Functional un\(|\)unparsing

DOI10.1007/s10990-012-9087-2zbMath1256.68029OpenAlexW1994127209MaRDI QIDQ1929354

Kenichi Asai, Oleg Kiselyov, Chung-Chieh Shan

Publication date: 8 January 2013

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-012-9087-2

zbMATH Keywords

functional programmingprogram derivationcontinuationsdelimited controltyped printftyped scanf

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Deforestation: Transforming programs to eliminate trees
• On typing delimited continuations: Three new solutions to the printf problem
• Final algebra semantics and data type extensions
• Specifications, models, and implementations of data abstractions
• Guarded recursive datatype constructors
• Polymorphic Delimited Continuations
• Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
• Continuation-Based Program Transformation Strategies
• Deriving Target Code as a Representation of Continuation Semantics
• Final Data Types and Their Specification
• What is a purely functional language?
• Functional unparsing
• Formatting: a class act
• A tutorial on the universality and expressiveness of fold
• A sound and complete axiomatization of delimited continuations
• A monadic framework for delimited continuations
• Delimited dynamic binding

This page was built for publication: Functional un\(|\)unparsing