Evaluating Call-by-Need on the Control Stack
- Cite this paper as:
- Chang S., Van Horn D., Felleisen M. (2011) Evaluating Call-by-Need on the Control Stack. In: Page R., Horváth Z., Zsók V. (eds) Trends in Functional Programming. TFP 2010. Lecture Notes in Computer Science, vol 6546. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.