A monadic framework for delimited continuations

DOI10.1017/S0956796807006259zbMath1130.68038MaRDI QIDQ5428371

Amr Sabry, R. Kent Dyvbig, Simon L. Peyton Jones

Publication date: 22 November 2007

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (12)

A Functional Abstraction of Typed Invocation Contexts ⋮ Unnamed Item ⋮ Functional un\(|\)unparsing ⋮ Disjunctive delimited control ⋮ Understanding algebraic effect handlers via delimited control operators ⋮ Effect handlers via generalised continuations ⋮ Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala ⋮ On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation ⋮ Delimited control in OCaml, abstractly and concretely ⋮ A static simulation of dynamic delimited control ⋮ A type-theoretic foundation of delimited continuations ⋮ Unnamed Item

Cites Work

• Notions of computation and monads
• A syntactic theory of sequential control
• The Zipper
• THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control

This page was built for publication: A monadic framework for delimited continuations