01067873

j

01067873 Sestoft, Peter Deriving a lazy abstract machine. J. Funct. Program. 7, No.3, 231-264 (1997). 1997 Cambridge University Press, Cambridge EN lambda calculus lazy functional language

doi:10.1017/S0956796897002712

Summary: We derive a simple abstract machine for lazy evaluation of the lambda calculus, starting from Launchbury's natural semantics. Lazy evaluation here means non-strict evaluation with sharing of argument evaluation, i.e. call-by-need. The machine we derive is a lazy version of Krivine's abstract machine, which was originally designed for call-by-name evaluation. We extend it with datatype constructors and base values, so the final machine implements all dynamic aspects of a lazy functional language.