Open AccessA Simple Proof of a Folklore Theorem about Delimited Control
Author(s) -
Dariusz Biernacki,
Olivier Danvy
Publication year - 2005
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v12i10.21876
Subject(s) - simple (philosophy) , folklore , control (management) , computer science , reset (finance) , semantics (computer science) , calculus (dental) , algebra over a field , mathematics , programming language , pure mathematics , artificial intelligence , philosophy , medicine , dentistry , epistemology , financial economics , economics , art , literature
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.