A Sound and Complete Axiomatization of Delimited Continuations (2003)
| Venue: | In Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP’03 |
| Citations: | 19 - 6 self |
BibTeX
@INPROCEEDINGS{Kameyama03asound,
author = {Yukiyoshi Kameyama and Masahito Hasegawa},
title = {A Sound and Complete Axiomatization of Delimited Continuations},
booktitle = {In Proc. of 8th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP’03},
year = {2003},
pages = {177--188},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept as the standard (unlimited) continuation, but it represents part of the rest of the computation, rather than the whole rest of computation. In the literature, the semantics of shift and reset has been given by a CPS-translation only. This paper gives a direct axiomatization of calculus with shift and reset, namely, we introduce a set of equations, and prove that it is sound and complete with respect to the CPS-translation. We also introduce a calculus with control operators which is as expressive as the calculus with shift and reset, has a sound and complete axiomatization, and is conservative over Sabry and Felleisen's theory for first-class continuations.
