Type theories, normal forms, and D∞-lambda-models
Information and Computation
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Set-theoretical and other elementary models of the &lgr;-calculus
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Journal of Computer and System Sciences
Full abstraction in the lazy lambda calculus
Information and Computation
Semantical analysis of perpetual strategies in &lgr;-calculus
Theoretical Computer Science - Special issue: Gentzen
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
| Hi-index | 0.00 |
The intersection-types discipline for λ-calculus was introduced in Coppo and Dezani-Ciancaglini (1980) as an extension of Curry's type assignment system. The motivation was essentially to increase the class of terms possessing types. Indeed, it turned out that this discipline can assign types to all and only the strongly normalising terms. This is largely a folklore result; the first published proof appears in Pottinger (1980). Subsequently, the intersection-types discipline was used in Barendregt et al. (1983) as a tool for proving Scott's conjecture concerning the completeness of the set-theoretic semantics for simple types.