On typing delimited continuations: Three new solutions to the printf problem

DOI10.1007/s10990-009-9049-5zbMath1202.68084OpenAlexW1969647297MaRDI QIDQ968365

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

zbMATH Keywords

typescontinuation-passing styleCPSdelimited continuationsdirect styleprintf

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (6)

Shifting the stage ⋮ Getting There and Back Again ⋮ Functional un\(|\)unparsing ⋮ Understanding algebraic effect handlers via delimited control operators ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Back to direct style
• Continuations: A mathematical semantics for handling full jumps
• From control effects to typed continuation passing
• Polymorphic Delimited Continuations
• Functional unparsing
• Formatting: a class act
• Representing Control: a Study of the CPS Transformation
• A sound and complete axiomatization of delimited continuations
• Programming Languages and Systems

This page was built for publication: On typing delimited continuations: Three new solutions to the printf problem