A Dynamic Extent Control Operator for Partial Continuations (1991)
| Venue: | In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages |
| Citations: | 30 - 6 self |
BibTeX
@INPROCEEDINGS{Queinnec91adynamic,
author = {Christian Queinnec and Bernard Serpette and Ecole Polytechnique},
title = {A Dynamic Extent Control Operator for Partial Continuations},
booktitle = {In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages},
year = {1991},
pages = {174--184},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: A partial continuation is a prefix of the computation that remains to be done. We propose in this paper a new operator which precisely controls which prefix is to be abstracted into a partial continuation. This operator is strongly related to the notion of dynamic extent which we denotationally characterize. Some programming examples are commented and we also show how to express previously proposed control operators. A suggested implementation is eventually discussed. Keywords: continuation, partial continuation, dynamic and indefinite extent, escape feature. Continuations were introduced within denotational semantics to express the "rest of the computation" in these cases where some constructs of a language can alter it. Non local exits or jumps (stop, goto), exception handling, failure semantics in Prolog-like languages are usually described with continuations [Stoy 77, Schmidt 86]. The Scheme language [Rees & Clinger 86] offers procedural first-class continuations with indefinit...
