19 search results - page 2 / 4 » On strong normalization and type inference in the intersecti... |
ICFP
2004
ACM
14 years 4 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
RTA
2007
Springer
13 years 11 months ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
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...
ICFP
1997
ACM
13 years 9 months ago
1997
ACM
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
PPDP
2004
Springer
13 years 10 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...