Compositional semantics for composable continuations: from abortive to delimited control

DOI10.1145/2628136.2628147MaRDI QIDQ2819670zbMATH OpenOpenAlexFDO

Authors Paul Downen, Zena M. Ariola

Publication date 29 September 2016

Published in Proceedings of the 19th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2628136.2628147

zbMATH Keywords

continuation-passing styledelimited controlequational theoryevaluation strategyprogram transformation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• An approach to call-by-name delimited continuations
• Delimited control and computational effects
• A type-theoretic foundation of delimited continuations
• The duality of computation
• A systematic approach to delimited control with multiple prompts

Cited in

(9)

• Delimited control and computational effects
• A systematic approach to delimited control with multiple prompts
• An approach to call-by-name delimited continuations
• Control reduction theories: the benefit of structural substitution
• Logical relations for coherence of effect subtyping
• Declarative continuations: an investigation of duality in programming language semantics
• Compiling with classical connectives
• An Operational Foundation for Delimited Continuations in the CPS Hierarchy
• Call-by-name is just call-by-value with delimited control

This page was built for publication: Compositional semantics for composable continuations: from abortive to delimited control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819670)