Lazy evaluation and delimited control

@inproceedings{Garcia2009LazyEA,
  title={Lazy evaluation and delimited control},
  author={Ronald Garcia and Andrew Lumsdaine and Amr Sabry},
  booktitle={POPL},
  year={2009}
}
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a series of reasoning steps, we systematically unpack the standard-order reduction relation of the calculus and discover a novel abstract machine definition which, like the calculus, goes "under lambdas." We prove that machine evaluation is equivalent to standard-order evaluation. Unlike traditional abstract machines… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Control operators, the SECD-machine, and the λ-calculus

  • M. Felleisen, D. P. Friedman
  • Formal Description of Programming Concepts, M…
  • 1986
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…