Transformations and reduction strategies for typed lambda expressions
Author:
Open Access
- 1 October 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 6 (4) , 603-631
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A scheme for implementing functional values on a stack machine1982
- An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP1980
- Languages with reducing reflexive typesLecture Notes in Computer Science, 1980
- Shallow binding in Lisp 1.5Communications of the ACM, 1978
- A model and stack implementation of multiple environmentsCommunications of the ACM, 1973
- The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problemACM SIGSAM Bulletin, 1970
- A correspondence between ALGOL 60 and Church's Lambda-notationsCommunications of the ACM, 1965
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964