Functional unparsing

48Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

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: printf ("Hello world."); printf ("The %s is %d.", "answer", 42); We 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.

Cite

CITATION STYLE

APA

Danvy, O. (1998). Functional unparsing. Journal of Functional Programming, 8(6), 621–625. https://doi.org/10.1017/S0956796898003104

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free