Typing and computational properties of lambda expressions
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 44 (1) , 51-68
- https://doi.org/10.1016/0304-3975(86)90109-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A filter lambda model and the completeness of type assignmentThe Journal of Symbolic Logic, 1983
- The Expressiveness of Simple and Second-Order Type StructuresJournal of the ACM, 1983
- Functional Characters of Solvable TermsMathematical Logic Quarterly, 1981
- An extension of the basic functionality theory for the $\lambda$-calculus.Notre Dame Journal of Formal Logic, 1980
- Resolution in type theoryThe Journal of Symbolic Logic, 1971
- Hauptsatz for higher order logicThe Journal of Symbolic Logic, 1968
- Completeness and Hauptsatz for second order logic1Theoria, 1967
- Functionals defined by recursion.Notre Dame Journal of Formal Logic, 1967
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940