Lazy evaluation and delimited control
Abstract
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics.
Related papers
- Compositional semantics for composable continuations: from abortive to delimited control ICFP 2014
- An approach to call-by-name delimited continuations POPL 2008
- Linear, bounded, functional pretty-printing JFP 2009
- Subtyping delimited continuations ICFP 2011
- Constraining Delimited Control with Contracts ESOP 2013
- A Systematic Approach to Delimited Control with Multiple Prompts ESOP 2012
- Shifting the Blame - A Blame Calculus with Delimited Control APLAS 2015
- Theoretical Pearl: A simple proof of a folklore theorem about delimited control JFP 2006