Abstract
Ariola and Felleisen's call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function applications-once established-are never discharged. In this paper we show how to translate this notion of reduction into an abstract machine that resolves variable references via the control stack. In particular, the machine uses the static address of a variable occurrence to extract its current value from the dynamic control stack. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Chang, S., Van Horn, D., & Felleisen, M. (2011). Evaluating call-by-need on the control stack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6546 LNCS, pp. 1–15). https://doi.org/10.1007/978-3-642-22941-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
