Sciweavers

JSC
2008
72views more  JSC 2008»
13 years 4 months ago
Flat matching
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
Temur Kutsia
FSTTCS
1993
Springer
13 years 8 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra
ICFP
2002
ACM
14 years 4 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann