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
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Calculi, types and applications
Theoretical Computer Science
| Hi-index | 0.00 |
We build two inverse limit lambda models which characterize completely sets of terms having similar computational behaviour. More precisely for each one 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. This is proved by using the finitary logical description of the models obtained by defining suitable intersection type assignment systems.