article

Functional unparsing

Author:

Olivier DanvyAuthors Info & Claims

Journal of Functional Programming, Volume 8, Issue 6

Pages 621 - 625

https://doi.org/10.1017/S0956796898003104

Published: 01 November 1998 Publication History

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.

References

[1]

Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation. Proc. 20th Annual ACM Symposium on Principles of Programming Languages, Graham, S. L. (ed.), pp. 493-501. ACM Press.

Digital Library

Google Scholar

[2]

Danvy, O. (1998) Functional unparsing (extended version). Technical Report BRICS RS-98-12, Department of Computer Science, University of Aarhus, Denmark.

Google Scholar

[3]

Mairson, H. (1991) Outline of a proof theory of parametricity. Proc. 5th ACM Conference on Functional Programming and Computer Architecture, Hughes, J. (ed.), pp. 313-327. Lecture Notes in Computer Science 523. Springer-Verlag.

Crossref

Google Scholar

[4]

Shields, M., Sheard, T. and Jones, S. P. (1998) Dynamic typing as staged type inference. Proc. 25th Annual ACM Symposium on Principles Of Programming Languages, Cardelli, L. (ed.), pp. 289-302. ACM Press.

Digital Library

Google Scholar

[5]

Yang, Z. (1998) Encoding types in ML-like languages (preliminary version). Technical Report BRICS RS-98-9. Department of Computer Science, University of Aarhus, Denmark.

Crossref

Google Scholar

Cited By

View all

Allais GDarais DGibbons J(2019)Generic level polymorphic n-ary functionsProceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3331554.3342604(14-26)Online publication date: 18-Aug-2019
https://dl.acm.org/doi/10.1145/3331554.3342604
Yallop Jvon Glehn TKammar O(2018)Partially-static data as free extension of algebrasProceedings of the ACM on Programming Languages10.1145/32367952:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236795
Asai KUehara CHenglein FKo H(2017)Selective CPS transformation for shift and resetProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3162069(40-52)Online publication date: 25-Dec-2017
https://dl.acm.org/doi/10.1145/3162069
Show More Cited By

Recommendations

Functional un|unparsing

Danvy's functional unparsing problem (Danvy in J. Funct. Program. 8(6), 621---625, 1998) is to implement a type-safe `printf' function, which converts a sequence of heterogeneous arguments to a string according to a given format. The dual problem is to ...
Design and implementation of a functional language with subtypes
Functional logic overloading
POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Functional logic overloading is a novel approach to user-defined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conceptually predicates on types in standard Haskell, they are type functions in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Functional Programming

Journal of Functional Programming Volume 8, Issue 6

November 1998

98 pages

ISSN:0956-7968

Issue’s Table of Contents

Publisher

Cambridge University Press

United States

Publication History

Published: 01 November 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Allais GDarais DGibbons J(2019)Generic level polymorphic n-ary functionsProceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3331554.3342604(14-26)Online publication date: 18-Aug-2019
https://dl.acm.org/doi/10.1145/3331554.3342604
Yallop Jvon Glehn TKammar O(2018)Partially-static data as free extension of algebrasProceedings of the ACM on Programming Languages10.1145/32367952:ICFP(1-30)Online publication date: 30-Jul-2018
https://dl.acm.org/doi/10.1145/3236795
Asai KUehara CHenglein FKo H(2017)Selective CPS transformation for shift and resetProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation10.1145/3162069(40-52)Online publication date: 25-Dec-2017
https://dl.acm.org/doi/10.1145/3162069
Stump A(2016)Quick Guide to SymbolsVerified Functional Programming in Agda10.1145/2841316.2841328Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841328
Stump A(2016)Intuitionistic Logic and Kripke SemanticsVerified Functional Programming in Agda10.1145/2841316.2841327Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841327
Stump A(2016)Reasoning About TerminationVerified Functional Programming in Agda10.1145/2841316.2841326Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841326
Stump A(2016)A Case Study: Huffman Encoding and DecodingVerified Functional Programming in Agda10.1145/2841316.2841325Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841325
Stump A(2016)Generating Agda Parsers with gratrVerified Functional Programming in Agda10.1145/2841316.2841324Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841324
Stump A(2016)Type-Level ComputationVerified Functional Programming in Agda10.1145/2841316.2841323Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841323
Stump A(2016)Internal VerificationVerified Functional Programming in Agda10.1145/2841316.2841322Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1145/2841316.2841322
Show More Cited By

Abstract

References

Cited By

Recommendations

Functional un|unparsing

Design and implementation of a functional language with subtypes

Functional logic overloading

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations