A type-theoretic foundation of continuations and prompts
From MaRDI portal
Publication:5178020
DOI10.1145/1016850.1016860zbMath1323.68090OpenAlexW4256143062MaRDI QIDQ5178020
Amr Sabry, Hugo Herbelin, Zena M. Ariola
Publication date: 9 March 2015
Published in: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1016850.1016860
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (6)
Programming and Proving with Classical Types ⋮ Combining algebraic effects with continuations ⋮ A proof-theoretic foundation of abortive continuations ⋮ Axioms for control operators in the CPS hierarchy ⋮ A static simulation of dynamic delimited control ⋮ A type-theoretic foundation of delimited continuations
This page was built for publication: A type-theoretic foundation of continuations and prompts
