The completeness theorem for typing λ-terms
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (1-2) , 1-17
- https://doi.org/10.1016/0304-3975(83)90136-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- Lambda‐Calculus Models and ExtensionalityMathematical Logic Quarterly, 1980
- Data Types as LatticesSIAM Journal on Computing, 1976
- Resolution in type theoryThe Journal of Symbolic Logic, 1971
- Modified basic functionality in combinatory logicDialectica, 1969
- Functionals defined by recursion.Notre Dame Journal of Formal Logic, 1967