A monadic framework for delimited continuations

Authors:
R. Kent Dyvbig;Simon Peyton Jones;Amr Sabry
Affiliations:
Indiana University, IN, USA;Microsoft Research, Cambridge, USA;Indiana University, IN, USA
Venue:
Journal of Functional Programming
Year:
2007

Citing 0
Cited 14

Lazy evaluation and delimited control

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introspecting continuations in order to update active code

Proceedings of the 1st International Workshop on Hot Topics in Software Upgrades
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Functional derivation of a virtual machine for delimited continuations

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
ReCaml: execution state as the cornerstone of reconfigurations

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The two-state solution: native and serializable continuations accord

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Representing covert movements by delimited continuations

JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
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
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation

Theoretical Computer Science
Delimited control in OCaml, abstractly and concretely

Theoretical Computer Science
A systematic approach to delimited control with multiple prompts

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Functional un|unparsing

Higher-Order and Symbolic Computation
Constraining delimited control with contracts

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

Delimited continuations are more expressive than traditional abortive continuations and they apparently require a framework beyond traditional continuation-passing style (CPS). We show that this is not the case: standard CPS is sufficient to explain the common control operators for delimited continuations. We demonstrate this fact and present an implementation as a Scheme library. We then investigate a typed account of delimited continuations that makes explicit where control effects can occur. This results in a monadic framework for typed and encapsulated delimited continuations, which we design and implement as a Haskell library.