Typing and computational properties of lambda expressions
Theoretical Computer Science
Type theories, normal forms, and D∞-lambda-models
Information and Computation
Complete restrictions of the intersection type discipline
Theoretical Computer Science
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Lambda-calculus, types and models
Lambda-calculus, types and models
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
Foundations of programming languages
Foundations of programming languages
Semantical analysis of perpetual strategies in &lgr;-calculus
Theoretical Computer Science - Special issue: Gentzen
Domains and lambda-calculi
Theoretical Computer Science - Modern algebra and its applications
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Lambda-terms as total or partial functions on normal forms
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
The Y-combinator in Scott''s Lambda-calculus Models
The Y-combinator in Scott''s Lambda-calculus Models
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
A Behavioural Model for Klop's Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculi, types and applications
Theoretical Computer Science
Theoretical Computer Science
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Types for hereditary head normalizing terms
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Hi-index | 0.00 |
We show how to characterise compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalisation, normalisation, head normalisation, and weak head normalisation. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation property, unrelated to termination, namely reducibility to a closed term.Many of these characterisation results are new, to our knowledge, or else they streamline, strengthen, or generalise earlier results in the literature.The completeness parts of the characterisations are proved uniformly for all the properties, using a set-theoretical semantics of intersection types over suitable kinds of stable sets. This technique generalises Krivine's and Mitchell's methods for strong normalisation to other evaluation properties.