Representing Control in the Presence of One-Shot Continuations

Representing Control in the Presence of One-Shot Continuations (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Carl Bruggeman , Oscar Waddell , R. Kent Dybvig

Citations:

46 - 3 self

BibTeX

@INPROCEEDINGS{Bruggeman96representingcontrol,
    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}
}

Bookmark

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 ...

Citations

1619	The De of Standard ML - Milner, Tofte, et al. - 1990 (Show Context) Citation Context ...shown in milliseconds. 7 of control, in which control stacks are represented as linked lists of frames rather than as true stacks. This approach is used by Appel and MacQueen [1] in a compiler for ML =-=[17]-=-. Appel and Shao [2] have compared their heap-based approach to a simulated stack-based approach and found them to have approximately the same per-frame overhead (an average of 7.5 and 7.4 instruction...
223	CML: A higher-order concurrent language - Reppy - 1991 (Show Context) Citation Context ... 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 and rapidly growing application area for first-class continuations. Continuations represent the remainde...
200	Standard ML of New Jersey - Appel, MacQueen - 1991 (Show Context) Citation Context ...running OSF/1. Times are shown in milliseconds. 7 of control, in which control stacks are represented as linked lists of frames rather than as true stacks. This approach is used by Appel and MacQueen =-=[1]-=- in a compiler for ML [17]. Appel and Shao [2] have compared their heap-based approach to a simulated stack-based approach and found them to have approximately the same per-frame overhead (an average ...
107	Performance and Evaluation of Lisp Systems - Gabriel - 1985 (Show Context) Citation Context ...amic-wind [8], and multiple return values [3]. To determine the benefit of one-shot continuations for programs in which call/cc can be replaced by call/1cc, we modified the call-intensive tak program =-=[11]-=- so that each call captures and invokes a continuation, either with call/cc or with call/1cc. The version using call/1cc is 13% faster than the version using call/cc and allocates 23% less memory. 5 f...
79	SCHEME: An Interpreter for Extended Lambda Calculus - Sussman, Steele, et al. - 1975 (Show Context) Citation Context ... 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], a...
75	Representing control in the presence of first-class continuations - Hieb, Dybvig, et al. - 1990 (Show Context) Citation Context ...e composed with abstractions based on multi-shot continuations in a consistent manner. 3 Implementation A detailed description of our implementation of multi-shot continuations is described elsewhere =-=[16]-=-. In this section, we review the essential details and discuss the changes necessary to implement one-shot continuations. 3.1 Segmented stack model In our model, the control stack is represented as a ...
52	Dybvig. The Scheme Programming Language - Kent - 1987 (Show Context) Citation Context ...n allocating a fresh stack (possibly from the stack cache). 4 Performance We have added one-shot continuations to the implementation of Chez Scheme while maintaining support for call/cc, dynamic-wind =-=[8]-=-, and multiple return values [3]. To determine the benefit of one-shot continuations for programs in which call/cc can be replaced by call/1cc, we modified the call-intensive tak program [11] so that ...
47	The spineless tagless G-machine - Jones, Salkild - 1989 (Show Context) Citation Context ...ent into the newly allocated stack segment. The overflow continuation thus includes the portion of the stack segment that is not copied. A similar mechanism is used in the spineless tagless G-machine =-=[19]-=- to solve essentially the same problem [18]. We found that, without the hysteresis provided by this mechanism, there was a noticeable performance degradation in certain programs. With this mechanism i...
36	Logic Continuations - Haynes - 1986 (Show Context) Citation Context ...bjects. 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 and rapidly growing appl...
35	A Multi-threaded Higher-order User Interface Toolkit - Gansner, Reppy - 1993 (Show Context) Citation Context ...d 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 and rapidly growing application area for first-class continuations. Continuations represent the remainder of a computation from a given point in the computation. When a continuation...
33	M.: Obtaining coroutines with continuations - Haynes, Friedman, et al. - 1986 (Show Context) Citation Context ... 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 and rapidly growing application area for fir...
30	An empirical and analytic study of stack vs. heap cost for languages with closures - Shao - 1994 (Show Context) Citation Context .... 7 of control, in which control stacks are represented as linked lists of frames rather than as true stacks. This approach is used by Appel and MacQueen [1] in a compiler for ML [17]. Appel and Shao =-=[2]-=- have compared their heap-based approach to a simulated stack-based approach and found them to have approximately the same per-frame overhead (an average of 7.5 and 7.4 instructions per frame, respect...
25	A Concurrent Window System - Pike (Show Context) Citation Context ...d 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 and rapidly growing application area for first-class continuations. Continuations represent the remainder of a computation from a given point in the computation. When a continuation...
24	Abstracting timed preemption with engines - Haynes, Friedman - 1987 (Show Context) Citation Context ... 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 and rapidly growing application area for first-class continuations. Continuations represent the remainde...
21	Transliterating Prolog into Scheme - Felleisen - 1985 (Show Context) Citation Context ...bjects. 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 and rapidly growing appl...
15	Dybvig. Register allocation using lazy saves, eager restores, and greedy shuffling - Burger, Waddell, et al. - 1995 (Show Context) Citation Context ...inates register increments and decrements used to support stack "push" and "pop" operations. 1 Our compiler actually passes the return address and the first few arguments in regist=-=ers, where feasible [4]-=-. Although this complicates the implementation only slightly, we assume a more straightforward model here to simplify our presentation. No explicit links are formed between frames on the stack. Some c...
15	et al. Revised Report on the Algorithmic Language Scheme - Clinger, Rees - 1991 (Show Context) Citation Context ...t 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 l...
12	Dybvig and Robert Hieb. Engines from continuations - Kent - 1989 (Show Context) Citation Context ... 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 and rapidly growing application area for first-class continuations. Continuations represent the remainde...
12	Montage: Breaking windows into small pieces - Haahr - 1990 (Show Context) Citation Context ...d 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 and rapidly growing application area for first-class continuations. Continuations represent the remainder of a computation from a given point in the computation. When a continuation...
8	Dybvig. An efficient implementation of multiple return values in scheme - Ashley, Kent - 1994 (Show Context) Citation Context ...ibly from the stack cache). 4 Performance We have added one-shot continuations to the implementation of Chez Scheme while maintaining support for call/cc, dynamic-wind [8], and multiple return values =-=[3]-=-. To determine the benefit of one-shot continuations for programs in which call/cc can be replaced by call/1cc, we modified the call-intensive tak program [11] so that each call captures and invokes a...
5	The spineless tagless G-machine - Peyton-Jones, Salkild - 1989 (Show Context) Citation Context ...ent into the newly allocated stack segment. The overflow continuation thus includes the portion of the stack segment that is not copied. A similar mechanism is used in the spineless tagless G-machine =-=[19]-=- to solve essentially the same problem [18]. We found that, without the hysteresis provided by this mechanism, there was a noticeable performance degradation in certain programs. With this mechanism i...
3	private communication - Peyton-Jones - 1991 (Show Context) Citation Context ... The overflow continuation thus includes the portion of the stack segment that is not copied. A similar mechanism is used in the spineless tagless G-machine [19] to solve essentially the same problem =-=[18]-=-. We found that, without the hysteresis provided by this mechanism, there was a noticeable performance degradation in certain programs. With this mechanism in place, deeply recursive programs run fast...
3	The Scheme Widget Library User's - Waddell - 1995 (Show Context) Citation Context ...d 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 and rapidly growing application area for first-class continuations. Continuations represent the remainder of a computation from a given point in the computation. When a continuation...