Type theories, normal forms, and D∞-lambda-models
Information and Computation
Full abstraction in the lazy lambda calculus
Information and Computation
Lambda-calculi for (strict) parallel functions
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
The discriminating power of multiplicities in the &lgr;-calculus
Information and Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Infinite &lgr;-calculus and types
Theoretical Computer Science - Special issue: Gentzen
Discrimination by parallel observers: the algorithm
Information and Computation
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Infinite normal forms for the lambda - calculus
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Calculi, types and applications
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce a type assignment system which is parametric withrespect to five families of trees obtained by evaluatingλ-terms (Bhm trees, Lvy-Longo trees, etc.). Then we prove,in an (almost) uniform way, that each type assignment system fullydescribes the observational equivalences induced by thecorresponding tree representation of λ-terms. Moreprecisely, for each family of trees, two λ-terms have thesame tree if and only if they get assigned the same types in thecorresponding type assignment system. Copyright 2002, ElsevierScience B.V.