Complexity of Normalization in the Pure Typed Lambda – Calculus
- 1 January 1982
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- Metamathematical Investigation of Intuitionistic Arithmetic and AnalysisPublished by Springer Nature ,1973