Proofs and types
Internal labellings in lambda-calculus
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Handbook of logic in computer science (vol. 2)
Lambda-calculus, types and models
Lambda-calculus, types and models
Intersection type assignment systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Strong normalization from weak normalization in typed &lgr;-calculi
Information and Computation
Perpetual reductions in &lgr;-calculus
Information and Computation
The Conservation Theorem revisited
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Une Extension de la Theorie des Types en lambda-Calcul
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
The simple semantics for Coppe-Dezani-Sallé types
Proceedings of the 5th Colloquium on International Symposium on Programming
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Addendum to ``New Notions of Reduction and Non-Semantic Proofs of Beta Strong Normalization in Typed Lambda Calculi''''
Ensuring termination by typability
Information and Computation
A Behavioural Model for Klop's Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
On Type Inference in the Intersection Type Discipline
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of strongly normalising λ-terms via non-idempotent intersection types
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
We give a proof for the strong normalization result in the intersection type discipline, which we obtain by putting together some well-known results and proof techniques. Our proof uses a variant of Klop's extended λ-calculus, for which it is shown that strong normalization is equivalent to weak normalization. This is proved here by means of a finiteness of developments theorem, obtained following de Vrijer's combinatory technique. Then we use the standard argument, formalized by Lévy as "the creation of redexes is decreasing" and implemented in proofs of weak normalization by Turing, and Coppo and Dezani for the intersection type discipline, to show that a typable expression of the extended calculus is normalizing.