A Simple Proof of a Folklore Theorem about Delimited Control

Dariusz Biernacki, Olivier Danvy


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.

Full Text:


DOI: http://dx.doi.org/10.7146/brics.v12i10.21876
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.

ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library