Complete restrictions of the intersection type discipline
Theoretical Computer Science
An equivalence between lambda-terms
Theoretical Computer Science
Domains and lambda-calculi
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
On normalisation
Mathematical Structures in Computer Science
Principality and type inference for intersection types using expansion variables
Theoretical Computer Science
Complexity aspects of programming language design: from logspace to elementary time via proofnets and intersection types
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
This pearl gives a discount proof of the folklore theorem that every strongly $\beta$-normalizing $\lambda$-term is typable with an intersection type. (We consider typings that do not use the empty intersection $\omega$ which can type any term.) The proof uses the perpetual reduction strategy which finds a longest path. This is a simplification over existing proofs that consider any longest reduction path. The choice of reduction strategy avoids the need for weakening or strengthening of type derivations. The proof becomes a bargain because it works for more intersection type systems, while being simpler than existing proofs.