A Simple Proof of a Folklore Theorem about Delimited Control
BRICS Report Series
View Archive InfoField | Value | |
Title |
A Simple Proof of a Folklore Theorem about Delimited Control
|
|
Creator |
Biernacki, Dariusz
Danvy, Olivier |
|
Description |
We formalize and prove the folklore theorem that the static delimited-control operators shift and reset can be simulated in terms of the dynamic delimited-control operators control and prompt. The proof is based on a small-step operational semantics that takes the form of an abstract machine.
|
|
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/21876
10.7146/brics.v12i10.21876 |
|
Source |
BRICS Report Series; No 10 (2005): RS-10 A Simple Proof of a Folklore Theorem about Delimited Control
BRICS Report Series; No 10 (2005): RS-10 A Simple Proof of a Folklore Theorem about Delimited Control 1601-5355 0909-0878 |
|
Language |
eng
|
|
Relation |
https://tidsskrift.dk/brics/article/view/21876/19303
|
|
Rights |
Copyright (c) 2015 BRICS Report Series
|
|