A lazy evaluator
1976pp. 95–103
Citations Over TimeTop 1% of 1976 papers
Abstract
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.
Related Papers
- → Compiling Laziness by Partial Evaluation(1991)15 cited
- → More haste, less speed: lazy versus eager evaluation(1997)15 cited
- → Specialization of lazy functional logic programs(1997)13 cited
- → Partial evaluation of lazy functional logic programs: Thesis(2003)3 cited
- → Static evaluation of functional programs(1986)8 cited