On typing delimited continuations: Three new solutions to the printf problem
From MaRDI portal
Publication:968365
DOI10.1007/S10990-009-9049-5zbMATH Open1202.68084OpenAlexW1969647297MaRDI QIDQ968365FDOQ968365
Authors: Kenichi Asai
Publication date: 5 May 2010
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.9641
Recommendations
- A Substructural Type System for Delimited Continuations
- Subtyping delimited continuations
- Typed Dynamic Control Operators for Delimited Continuations
- A type-theoretic foundation of delimited continuations
- Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
- Polymorphic Delimited Continuations
- An approach to call-by-name delimited continuations
- A type-theoretic foundation of continuations and prompts
- Program derivation in type theory: A partitioning problem
- A hierarchy for delimited continuations in call-by-name
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Back to direct style
- Polymorphic Delimited Continuations
- Representing Control: a Study of the CPS Transformation
- Functional unparsing
- Continuations: A mathematical semantics for handling full jumps
- From control effects to typed continuation passing
- Formatting: a class act
- A sound and complete axiomatization of delimited continuations
- Programming Languages and Systems
Cited In (7)
This page was built for publication: On typing delimited continuations: Three new solutions to the printf problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968365)