Infinite λ-calculus and types
- 6 February 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 212 (1-2) , 29-75
- https://doi.org/10.1016/s0304-3975(98)00135-2
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Filter Model for Concurrent $\lambda$-CalculusSIAM Journal on Computing, 1998
- Filter models for conjunctive-disjunctive λ-calculiTheoretical Computer Science, 1996
- Some new results on easy lambda-termsTheoretical Computer Science, 1993
- Full Abstraction in the Lazy Lambda CalculusInformation and Computation, 1993
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculusJournal of Computer and System Sciences, 1992
- Domain theory in logical form*Annals of Pure and Applied Logic, 1991
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Ω Can be anything it should not beIndagationes Mathematicae, 1979
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972