A lazy evaluator
Lazy evaluation
Partial evaluation
Substitution (logic)
Critical section
DOI:
10.1145/800168.811543
Publication Date:
2003-06-02T17:12:42Z
AUTHORS (2)
ABSTRACT
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having perform more steps than usual method. Although central idea can be found in earlier work this paper interest since it treats a rather well-known language works out an algorithm which avoids full substitution. partial correctness proof using Scott-Strachey semantics sketched later section.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (153)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....