Functional unparsing

Authors:
Olivier Danvy
Affiliations:
BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark (e-mail: danvy@brics.dk)
Venue:
Journal of Functional Programming
Year:
1998

Citing 3
Cited 29

Tutorial notes on partial evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic typing as staged type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Outline of a Proof Theory of Parametricity

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture

Functional logic overloading

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Template meta-programming for Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Techniques for embedding postfix languages in Haskell

Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Template meta-programming for Haskell

ACM SIGPLAN Notices
Polymorphic typed defunctionalization

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Do we need dependent types?

Journal of Functional Programming
Formatting: a class act

Journal of Functional Programming
Encoding types in ML-like languages

Theoretical Computer Science - Mathematical foundations of programming semantics
Improving the static analysis of embedded languages via partial evaluation

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Embedded interpreters

Journal of Functional Programming
Associated type synonyms

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
TypeCase: a design pattern for type-indexed functions

Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Polymorphic typed defunctionalization and concretization

Higher-Order and Symbolic Computation
Ocsigen: typing web interaction with objective Caml

Proceedings of the 2006 workshop on ML
Dependent ML An approach to practical programming with dependent types

Journal of Functional Programming
Variadic templates for C++

Proceedings of the 2007 ACM symposium on Applied computing
Calling variadic functions from a strongly-typed language

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Many holes in hindley-milner

Proceedings of the 2008 ACM SIGPLAN workshop on ML
Type-safe pattern combinators

Journal of Functional Programming
Experience report: ocsigen, a web programming framework

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
On typing delimited continuations: three new solutions to the printf problem

Higher-Order and Symbolic Computation
Undoing dynamic typing (declarative pearl)

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Typed dynamic control operators for delimited continuations

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Invertible syntax descriptions: unifying parsing and pretty printing

Proceedings of the third ACM Haskell symposium on Haskell
Type classes as objects and implicits

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Shifting the stage: Staging with delimited control

Journal of Functional Programming
Typed tagless final interpreters

SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Functional un|unparsing

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A string-formatting function such as printf in C seemingly requires dependent types, because its control string determines the rest of its arguments. Examples:formula hereWe show how changing the representation of the control string makes it possible to program printf in ML (which does not allow dependent types). The result is well typed and perceptibly more efficient than the corresponding library functions in Standard ML of New Jersey and in Caml.