On typing delimited continuations: Three new solutions to the printf problem
From MaRDI portal
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
- A sound and complete axiomatization of delimited continuations
- Back to direct style
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Continuations: A mathematical semantics for handling full jumps
- Formatting: a class act
- From control effects to typed continuation passing
- Functional unparsing
- Polymorphic Delimited Continuations
- Programming Languages and Systems
- Representing Control: a Study of the CPS Transformation
Cited in
(7)- Getting There and Back Again
- Functional un\(|\)unparsing
- Understanding algebraic effect handlers via delimited control operators
- Theorem Proving in Higher Order Logics
- scientific article; zbMATH DE number 7559296 (Why is no real title available?)
- Shifting the stage. Staging with delimited control
- scientific article; zbMATH DE number 7533352 (Why is no real title available?)
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)
