17 search results - page 1 / 4 » Unification in a Lambda-Calculus with Intersection Types |
SLP
1993
13 years 6 months ago
1993
TCS
2008
13 years 4 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
We present a typed intermediate language λCIL for optimizing compilers for function-oriented and polymorphically typed programming languages (e.g., ML). The language λCIL is a ty...