17 search results - page 2 / 4 » Unification in a Lambda-Calculus with Intersection Types |
ENTCS
2002
13 years 5 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
ICFP
2002
ACM
14 years 5 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...
SAS
1997
Springer
13 years 9 months ago
1997
Springer
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
FOSSACS
2009
Springer
14 years 1 days ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
FSTTCS
1993
Springer
13 years 9 months ago
1993
Springer
This paper will show the usefulness and elegance of strict intersection types for the Lambda Calculus; these are strict in the sense that they are the representatives of equivalen...