A static simulation of dynamic delimited control
From MaRDI portal
Publication:2464731
DOI10.1007/s10990-007-9010-4zbMath1128.68010OpenAlexW2041438114MaRDI QIDQ2464731
Publication date: 17 December 2007
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-007-9010-4
Continuation-passing styleControl and promptDelimited control operatorsMacro expressibilityShift and reset
Related Items
A Functional Abstraction of Typed Invocation Contexts, Understanding algebraic effect handlers via delimited control operators, Effect handlers via generalised continuations, No value restriction is needed for algebraic effects and handlers, On one-pass CPS transformations, Unnamed Item, Unnamed Item, Delimited control and computational effects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- A syntactic correspondence between context-sensitive calculi and abstract machines
- On the dynamic extent of delimited continuations
- On the expressive power of programming languages
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Revised report on the algorithmic language scheme
- Back to direct style
- Continuations: A mathematical semantics for handling full jumps
- A functional correspondence between call-by-need evaluators and lazy abstract machines
- On the static and dynamic extents of delimited continuations
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Acute
- Backtracking, interleaving, and terminating monad transformers
- Weaving a web
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- Continuation-Based Program Transformation Strategies
- The Zipper
- Representing Control: a Study of the CPS Transformation
- Recursive subtyping revealed
- Combinators for program generation
- A type-theoretic foundation of continuations and prompts
- An Operational Foundation for Delimited Continuations in the CPS Hierarchy
- Computer Science Logic
- A Rational Deconstruction of Landin’s SECD Machine
- A monadic framework for delimited continuations
- THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
- Delimited dynamic binding
- Logic Based Program Synthesis and Transformation
- The Mechanical Evaluation of Expressions
- The second Futamura projection for type-directed partial evaluation
