Typing and computational properties of lambda expressions
Theoretical Computer Science
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Complete restrictions of the intersection type discipline
Theoretical Computer Science
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
Full abstraction in the lazy lambda calculus
Information and Computation
Foundations of programming languages
Foundations of programming languages
Domains and lambda-calculi
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Lambda-terms as total or partial functions on normal forms
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Applicative Information Systems
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Intersection types and domain operators
Theoretical Computer Science - Logic, semantics and theory of programming
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Intersection types and domain operators
Theoretical Computer Science - Logic, semantics and theory of programming
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
Calculi, types and applications
Theoretical Computer Science
Theoretical Computer Science
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Type Preorders and Recursive Terms
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Intersection Types and Termination Properties
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Hi-index | 0.00 |
We construct two inverse limit λ-models which completely characterise sets of terms with similar computational behaviours: the sets of normalising, head normalising, weak head normalising λ-terms, those corresponding to the persistent versions of these notions, and the sets of closable, closable normalising, and closable head normalising λ-terms. More precisely, for each of these sets of terms there is a corresponding element in at least one of the two models such that a term belongs to the set if and only if its interpretation (in a suitable environment) is greater than or equal to that element. We use the finitary logical description of the models, obtained by defining suitable intersection type assignment systems, to prove this.