A new implementation technique for applicative languages. (English) Zbl 0386.68009


68N01 General topics in the theory of software
68N25 Theory of operating systems
Full Text: DOI


[1] SASL Language Manual, University of St. Andrews, 1976.
[2] Landin, Comput. J. 6 pp 308– (1963–4) · Zbl 0122.36106
[3] et al, LISP 1.5 Programmers Manual, M.I.T. Press, 1962.
[4] and , The Implementation of Algol 60, Academic Press, 1964. · Zbl 0115.12702
[5] Schonfinkel, Math. Annalen 92 pp 305– (1924)
[6] and , Combinatory Logic, Vol. I, North Holland, 1958.
[7] Recursive Programming Techniques, Addison-Wesley, 1975. · Zbl 0321.68002
[8] Turner, Journal of Symbolic Logic.
[9] Semantics and Pragmatics of the {\(\lambda\)}-calculus, Chapter 4, Oxford University; DPhil. Thesis, 1971.
[10] and , A lazy evaluator, 3rd Symposium on Principles of Programming Languages, Altanta, 1976.
[11] and , CONS should not evaluate its arguments, 3rd int. colloq. Automata Languages and Programming, Edinburgh, 1976.
[12] Programming without Assignment (to appear).
[13] An Implementation of SASL, University of St. Andrews, Dept. of Comp. Science, Report TR/75/4.
[14] Brown, Software–Practice and Experience 6 pp 423– (1976)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.