Completeness of type assignment in continuous lambda models
Author:
- 1 January 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 29 (3) , 309-324
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The completeness theorem for typing λ-termsTheoretical Computer Science, 1983
- Curry's type-rules are complete with respect to the F-semantics tooTheoretical Computer Science, 1983
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- What is a model of the lambda calculus?Information and Control, 1982
- Algebras and combinatorsAlgebra universalis, 1981
- Lambda‐Calculus Models and ExtensionalityMathematical Logic Quarterly, 1980
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- Tω as a Universal DomainJournal of Computer and System Sciences, 1978
- Data Types as LatticesSIAM Journal on Computing, 1976
- A Syntactic Characterization of the Equality in Some Models for the Lambda CalculusJournal of the London Mathematical Society, 1976