Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Higher-Order Dynamic Pattern Unification for Dependent Types and Records
 

Summary: Higher-Order Dynamic Pattern Unification for
Dependent Types and Records
Andreas Abel1
and Brigitte Pientka2
1
Institut f®ur Informatik, Ludwig-Maximilians-Universit®at, M®unchen, Deutschland
andreas.abel@ifi.lmu.de
2
School of Computer Science, McGill University, Montreal, Canada
bpientka@cs.mcgill.ca
Abstract. While higher-order pattern unification for
-calculus is de-
cidable and unique unifiers exists, we face several challenges in practice:
1) the pattern fragment itself is too restrictive for many applications; this
is typically addressed by solving sub-problems which satisfy the pattern
restriction eagerly but delay solving sub-problems which are non-patterns
until we have accumulated more information. This leads to a dynamic
pattern unification. 2) Many systems implement
calculus and hence
the known pattern unification algorithms for

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences