A Simple Proof of a Folklore Theorem about Delimited Control

Dariusz Biernacki; Olivier Danvy

doi:10.7146/brics.v12i10.21876

A Simple Proof of a Folklore Theorem about Delimited Control

Authors

Dariusz Biernacki
Olivier Danvy

DOI:

https://doi.org/10.7146/brics.v12i10.21876

Abstract

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.

Downloads

Published

2005-03-11

How to Cite

Biernacki, D., & Danvy, O. (2005). A Simple Proof of a Folklore Theorem about Delimited Control. BRICS Report Series, 12(10). https://doi.org/10.7146/brics.v12i10.21876