| |
VOLUME 1, ISSUE 2, PAPER 5
|
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
|
©Malgorzata Biernacka, BRICS, University of Aarhus, Denmark
©Dariusz Biernacki, BRICS, University of Aarhus, Denmark
©Olivier Danvy, BRICS, University of Aarhus, Denmark
|
Abstract
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.
|
Publication date: November 8, 2005
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-1(2:5)2005
Hit Counts: 3957 |
 Creative Commons | |
