A systematic approach to delimited control with multiple prompts

Authors:
Paul Downen;Zena M. Ariola
Affiliations:
University of Oregon;University of Oregon
Venue:
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Year:
2012

Citing 18
Cited 0

A syntactic theory of sequential control

Theoretical Computer Science
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
Reasoning with continuations II: full abstraction for models of 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
Representing layered monads

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The duality of computation

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A Syntactic Theory of Dynamic Binding

Higher-Order and Symbolic Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Delimited dynamic binding

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A monadic framework for delimited continuations

Journal of Functional Programming
Control reduction theories: The benefit of structural substitution

Journal of Functional Programming
Lazy evaluation and delimited control

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refunctionalization at work

Science of Computer Programming
A type-theoretic foundation of delimited continuations

Higher-Order and Symbolic Computation
Subtyping delimited continuations

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Delimited control in OCaml, abstractly and concretely: system description

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formalize delimited control with multiple prompts, in the style of Parigot's λμ-calculus, through a series of incremental extensions by starting with the pure λ-calculus. Each language inherits the semantics and reduction theory of its parent, giving a systematic way to describe each level of control.