A type-theoretic foundation of delimited continuations
From MaRDI portal
Publication:968364
DOI10.1007/S10990-007-9006-0zbMATH Open1213.68187OpenAlexW2128246210MaRDI QIDQ968364FDOQ968364
Authors: Zena M. Ariola, Hugo Herbelin, Amr Sabry 
Publication date: 5 May 2010
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00177326/file/hosc-AriHerSab07-delim-cont.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Subtractive logic
- Title not available (Why is that?)
- The revised report on the syntactic theories of sequential control and state
- \(\lambda\mu\)-calculus and Böhm's theorem
- Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
- Title not available (Why is that?)
- The duality of computation
- A syntactic theory of sequential control
- Title not available (Why is that?)
- A monadic framework for delimited continuations
- Title not available (Why is that?)
- A Formulae-as-Types Interpretation of Subtractive Logic
- A syntactic theory of dynamic binding
- Comparing control constructs by double-barrelled CPS
- Sound and complete axiomatisations of call-by-value control operators
- A type-theoretic foundation of continuations and prompts
- Obtaining coroutines with continuations
- Unchecked exceptions can be strictly more powerful than call/cc
- Explicit substitutions and reducibility
- Control reduction theories: the benefit of structural substitution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sound and complete axiomatization of delimited continuations
Cited In (22)
- Typed Dynamic Control Operators for Delimited Continuations
- Hoare-style reasoning with (algebraic) continuations
- Polymorphic Delimited Continuations
- A Substructural Type System for Delimited Continuations
- Title not available (Why is that?)
- On typing delimited continuations: Three new solutions to the printf problem
- Axiomatizing subtyped delimited continuations
- A monadic framework for delimited continuations
- A Formulae-as-Types Interpretation of Subtractive Logic
- A type-theoretic foundation of continuations and prompts
- Control effects as a modality
- A classical sequent calculus with dependent types
- A type system for continuation calculus
- Delimited control operators prove double-negation shift
- Compositional semantics for composable continuations: from abortive to delimited control
- Classical call-by-need and duality
- Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
- Declarative continuations: an investigation of duality in programming language semantics
- Title not available (Why is that?)
- Subtyping delimited continuations
- Delimited control and computational effects
- A sound and complete axiomatization of delimited continuations
This page was built for publication: A type-theoretic foundation of delimited continuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968364)
