Type theories, normal forms, and D∞-lambda-models
Information and Computation
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
Information and Computation
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
The Lattice of Lambda Theories
Journal of Logic and Computation
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Graph models of $\lambda$-calculus at work, and variations
Mathematical Structures in Computer Science
Theoretical Computer Science - Algebraic methods in language processing
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
Calculi, types and applications
Theoretical Computer Science
Theoretical Computer Science
Type Preorders and Recursive Terms
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We use intersection types as a tool for obtaining λ-models. Relying on the notion of easy intersection type theory, we successfully build a λ-model in which the interpretation of an arbitrary simple easy term is any filter which can be described by a continuous predicate. This allows us to prove two results. The first gives a proof of consistency of the λ-theory where the λ-term (λx.xx)(λx.xx) is forced to behave as the join operator. This result has interesting consequences on the algebraic structure of the lattice of λ-theories. The second result is that for any simple easy term, there is a λ-model, where the interpretation of the term is the minimal fixed point operator.