On the dynamic extent of delimited continuations

Authors:
Dariusz Biernacki;Olivier Danvy;Chung-chieh Shan
Affiliations:
Department of Computer Science, University of Aarhus, Aabogade, Aarhus N, Denmark;Department of Computer Science, University of Aarhus, Aabogade, Aarhus N, Denmark;Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA
Venue:
Information Processing Letters
Year:
2005

Citing 13
Cited 2

Abstract continuations: a mathematical semantics for handling full jumps

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
The theory and practice of first-class prompts

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstracting control

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Representing monads

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generalization of exceptions and control in ML-like languages

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Continuation-Based Program Transformation Strategies

Journal of the ACM (JACM)
Breadth-first numbering: lessons from a small exercise in algorithm design

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Definitional Interpreters for Higher-Order Programming Languages

Higher-Order and Symbolic Computation
Scheme: A Interpreter for Extended Lambda Calculus

Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps

Higher-Order and Symbolic Computation
Defunctionalization at work

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Rabbit: A Compiler for Scheme

Rabbit: A Compiler for Scheme
Functional programming with names and necessity

Functional programming with names and necessity

On the static and dynamic extents of delimited continuations

Science of Computer Programming
A static simulation of dynamic delimited control

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum.