An Operational Foundation for Delimited Continuations in the CPS Hierarchy
From MaRDI portal
Publication:5310642
DOI10.2168/LMCS-1(2:5)2005zbMath1125.68050OpenAlexW3105810746MaRDI QIDQ5310642
Olivier Danvy, Małgorzata Biernacka, Dariusz Biernacki
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-1(2:5)2005
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
A Functional Abstraction of Typed Invocation Contexts ⋮ Unnamed Item ⋮ A syntactic correspondence between context-sensitive calculi and abstract machines ⋮ Automating the functional correspondence between higher-order evaluators and abstract machines ⋮ Inter-deriving Semantic Artifacts for Object-Oriented Programming ⋮ Refunctionalization at work ⋮ Axioms for control operators in the CPS hierarchy ⋮ A static simulation of dynamic delimited control ⋮ A Context-based Approach to Proving Termination of Evaluation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From Reduction-Based to Reduction-Free Normalization ⋮ On the dynamic extent of delimited continuations
This page was built for publication: An Operational Foundation for Delimited Continuations in the CPS Hierarchy
