Representing Control in the Presence of One-Shot Continuations (1996) [40 citations — 3 self]
http://grouchy.cs.indiana.edu/hyplan/bruggema/pape
http://www-cse.uta.edu/~bruggema/papers/one-shots.
http://www.cs.indiana.edu/~dyb/papers/Call-1cc-PLD
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Carl Bruggeman and Oscar Waddell and R. Kent Dybvig},
title = {Representing Control in the Presence of One-Shot Continuations},
booktitle = {},
year = {1996},
pages = {99--107}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Traditional first-class continuation mechanisms allow a captured continuation to be invoked multiple times. Many continuations, however, are invoked only once. This paper introduces one-shot continuations, shows how they interact with traditional multi-shot continuations, and describes a stack-based implementation of control that handles both one-shot and multi-shot continuations. The implementation eliminates the copying overhead for one-shot continuations that is inherent in multi-shot continuations. 1 Introduction Scheme [5] and some implementations of ML [17] provide continuations as first-class data objects. Continuations can be used to implement, at the source level, a number of interesting control features, such as loops, nonlocal exits, nonblind backtracking [22], nondeterministic computations [10, 14], and coroutines [7]. Source-level implementations of thread systems [9, 15, 21], especially in the area of graphical user interfaces (GUIs) [12, 13, 20, 23], are an important ...
