34 search results - page 7 / 7 » A Complete Narrowing Calculus for Higher-Order Functional Lo... |
ESOP
2006
Springer
13 years 9 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
FLOPS
2008
Springer
13 years 7 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
ICFP
2003
ACM
14 years 6 months ago
2003
ACM
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
ICFP
2002
ACM
14 years 6 months ago
2002
ACM
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...