An Operational Foundation for Delimited Continuations in the CPS Hierarchy
<|reference_start|>An Operational Foundation for Delimited Continuations in the CPS Hierarchy: We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a small-step operational semantics with an explicit representation of evaluation contexts) is constructed from the abstract machine; and the control operators are the shift and reset family. We also present new applications of delimited continuations in the CPS hierarchy: finding list prefixes and normalization by evaluation for a hierarchical language of units and products.<|reference_end|>
@article{biernacka2005an,
    title={An Operational Foundation for Delimited Continuations in the CPS
  Hierarchy},
    author={Malgorzata Biernacka and Dariusz Biernacki and Olivier Danvy},
    journal={Logical Methods in Computer Science, Volume 1, Issue 2 (November
  8, 2005) lmcs:2269},
    year={2005},
    doi={10.2168/LMCS-1(2:5)2005},
    archivePrefix={arXiv},
    eprint={cs/0508048},
    primaryClass={cs.LO cs.PL}
}