An efficient interpreter for the lambda-calculus
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (3) , 383-424
- https://doi.org/10.1016/0022-0000(81)90073-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Prolegomena to a theory of mechanized formal reasoningArtificial Intelligence, 1980
- Stack implementation of shallow binding in languages with mixed scopingInformation Processing Letters, 1979
- History of LISPACM SIGPLAN Notices, 1978
- A partial evaluator, and its use as a programming toolArtificial Intelligence, 1977
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- A CUCH-machine: The automatic treatment of bound variablesInternational Journal of Parallel Programming, 1972
- Logic for Computable Functions Description of a Machine ImplementationPublished by Defense Technical Information Center (DTIC) ,1972
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problemACM SIGSAM Bulletin, 1970