Call-by-name, call-by-value and the λ-calculus
Open Access
- 31 December 1975
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 1 (2), 125-159
- https://doi.org/10.1016/0304-3975(75)90017-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A simplification of combinatory logicThe Journal of Symbolic Logic, 1972
- Lambda calculus schemataPublished by Association for Computing Machinery (ACM) ,1972
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference conceptCommunications of the ACM, 1970
- The correctness of a modified SECD machinePublished by Association for Computing Machinery (ACM) ,1970
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964