1991 · 48 citations · 17 references
ComputingComputer ScienceComputer SystemsCompilersFormal MethodsProgramming LanguagesControl TheoryData-flow AnalysisDynamic Programming
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.
17
Olivier Danvy, Andrzej Filinski · 1990 · 403 citations · Full text
The theory and practice of first-class prompts
Matthias Felleisen · 1988 · 291 citations
Continuation-based multiprocessing
Mitchell Wand · 1980 · 142 citations