Since 2014
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
|
|
| Creator |
Biernacka, Malgorzata
Biernacki, Dariusz Danvy, Olivier |
|
| Description |
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. At level n of the CPS hierarchy, programs can use the control operators shift_i and reset_i for 1
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
2005-03-11
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/21877
10.7146/brics.v12i11.21877 |
|
| Source |
BRICS Report Series; No 11 (2005): RS-11 An Operational Foundation for Delimited Continuations in the CPS Hierarchy
BRICS Report Series; No 11 (2005): RS-11 An Operational Foundation for Delimited Continuations in the CPS Hierarchy 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/21877/19304
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|