Final Shift for Call/cc: Direct Implementation of Shift and Reset (2002)
by
Martin Gasbichler
,
Michael Sperber
| Citations: | 12 - 0 self |
BibTeX
@MISC{Gasbichler02finalshift,
author = {Martin Gasbichler and Michael Sperber},
title = {Final Shift for Call/cc: Direct Implementation of Shift and Reset},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating shift and reset via call/cc. Typical applications of these operators exhibit space savings and a significant overall performance gain. Our technique is based upon the popular incremental stack/heap strategy for representing continuations. We present implementation details as well as some benchmark measurements for typical applications.
Citations
| 195 | Type-directed partial evaluation - Danvy - 1998 |
| 41 | Representing control in the presence of one-shot continuations - Bruggeman, Waddell, et al. - 1996 |
| 31 | A scheme for a higher-level semantic algebra - Clinger, Friedman, et al. - 1985 |
| 20 | Implementation strategies for first-class continuations, Higher-Order and Symbolic Computation 12 - Clinger, Hartheimer, et al. - 1999 |
| 20 | 2000, `Formalizing Implementation Strategies for First-Class Continuations - Danvy |
| 16 | Strong normalization by type-directed partial evaluation and run-time code generation - Balat, Danvy - 1998 |
