A functional correspondence between call-by-need evaluators and lazy abstract machines
- 15 June 2004
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 90 (5) , 223-232
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational EffectsBRICS Report Series, 2003
- A Rational Deconstruction of Landin's SECD MachineBRICS Report Series, 2003
- A Denotational Investigation of DefunctionalizationBRICS Report Series, 2000
- Abstract machines for programming language implementationFuture Generation Computer Systems, 2000
- Definitional Interpreters for Higher-Order Programming LanguagesHigher-Order and Symbolic Computation, 1998
- Functional runtime systems within the lambda-sigma calculusJournal of Functional Programming, 1998
- From operational semantics to abstract machinesMathematical Structures in Computer Science, 1992
- The semantics of lazy functional languagesTheoretical Computer Science, 1989
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- The Mechanical Evaluation of ExpressionsThe Computer Journal, 1964