Word operation definable in the typed λ-calculus
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 52 (1-2) , 1-14
- https://doi.org/10.1016/0304-3975(87)90077-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- λ-definable functionals andβη conversionArchive for Mathematical Logic, 1983
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- Definierbare Funktionen imλ-Kalkül mit TypenArchive for Mathematical Logic, 1975
- A unification algorithm for typed