TY - JOUR T1 - Evaluating Call-By-Need on the Control Stack JF - arXiv:1009.3174 [cs] Y1 - 2010 A1 - Chang, Stephen A1 - David Van Horn A1 - Felleisen, Matthias KW - Computer Science - Programming Languages KW - D.3.1 AB - Ariola and Felleisen's call-by-need {\lambda}-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. UR - http://arxiv.org/abs/1009.3174 N1 - Comment: Symposium on Trends in Functional Programming (TFP 2010), Norman, Oklahoma, May 2010 ER -