article

Open access

Pretty printing with lazy dequeues

Author:

Olaf ChitilAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 27, Issue 1

Pages 163 - 184

https://doi.org/10.1145/1053468.1053473

Published: 01 January 2005 Publication History

PDF eReader

Abstract

There are several purely functional libraries for converting tree structured data into indented text, but they all make use of some backtracking. Over twenty years ago, Oppen published a more efficient imperative implementation of a pretty printer. This article shows that the same efficiency is also obtainable without destructive updates by developing a similar but purely functional Haskell implementation with the same complexity bounds. At its heart lie two lazy double ended queues.

References

[1]

Azero, P. and Swierstra, D. 1998. Optimal pretty-printing combinators. http://www.cs.uu.nl/groups/ST/Center/SoftwareDistributions.

Google Scholar

[2]

Bird, R. S. 1984. Using circular programs to eliminate multiple traversals of data. Acta Inf. 21, 239--250.

Google Scholar

[3]

Hughes, J. 1986. A novel representation of lists and its application to the function “reverse”. Inf. Proc. Lett. 22, 3, 141---144.

Crossref

Google Scholar

[4]

Hughes, J. 1995. The design of a pretty-printing library. In Advanced Functional Programming, J. Jeuring and E. Meijer, Eds. Lecture Notes in Computer Science, vol. 925. Springer-Verlag, New York.

Crossref

Google Scholar

[5]

Okasaki, C. 1998. Purely Functional Data Structures. Cambridge University Press.

Crossref

Google Scholar

[6]

Okasaki, C. 2000. Breadth-first numbering: Lessons from a small exercise in algorithm design. In Proceedings of the International Conference on Functional Programming. 131--136.

Crossref

Google Scholar

[7]

Oppen, D. C. 1980. Prettyprinting. ACM Trans. Prog. Lang. Syst. 2, 4, 465--483.

Crossref

Google Scholar

[8]

Peyton Jones, S. L. 1997. A pretty printer library in Haskell. Part of the GHC distribution at http://www.haskell.org/ghc.

Google Scholar

[9]

Peyton Jones, S. L., Ed. 2003. Haskell 98 Language and Libraries, The Revised Report. Cambridge University Press.

Google Scholar

[10]

Wadler, P. 2003. A prettier printer. In The Fun of Programming. Palgrave Macmillan, Chapter 11, 223--244.

Google Scholar

Cited By

View all

Porncharoenwase SPombrio JTorlak E(2023)A Pretty Expressive PrinterProceedings of the ACM on Programming Languages10.1145/36228377:OOPSLA2(1122-1149)Online publication date: 16-Oct-2023
Parr TVinju JStorm TBalland EVarro D(2016)Towards a universal code formatter through machine learningProceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering10.1145/2997364.2997383(137-151)Online publication date: 20-Oct-2016
Storm TBalland EVarro D(2016)Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language EngineeringundefinedOnline publication date: 20-Oct-2016
Show More Cited By

Index Terms

Pretty printing with lazy dequeues
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Linked lists
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

Heap recycling for lazy languages
PEPM '08: Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation

Pure functional programming languages preclude destructive updates of heap-allocated data. In such languages, all newly computed algebraic values claim freshly allocated heap space, which typically causes idiomatic programs to be notoriously inefficient ...
Practical typed lazy contracts
ICFP '12

Until now there has been no support for specifying and enforcing contracts within a lazy functional program. That is a shame, because contracts consist of pre- and post-conditions for functions that go beyond the standard static types. This paper ...
Practical typed lazy contracts
ICFP '12: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Until now there has been no support for specifying and enforcing contracts within a lazy functional program. That is a shame, because contracts consist of pre- and post-conditions for functions that go beyond the standard static types. This paper ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 27, Issue 1

January 2005

184 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/1053468

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 2005

Published in TOPLAS Volume 27, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
708
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)3

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Porncharoenwase SPombrio JTorlak E(2023)A Pretty Expressive PrinterProceedings of the ACM on Programming Languages10.1145/36228377:OOPSLA2(1122-1149)Online publication date: 16-Oct-2023
Parr TVinju JStorm TBalland EVarro D(2016)Towards a universal code formatter through machine learningProceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering10.1145/2997364.2997383(137-151)Online publication date: 20-Oct-2016
Storm TBalland EVarro D(2016)Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language EngineeringundefinedOnline publication date: 20-Oct-2016
Podkopaev ABoulytchev D(2015)Polynomial-Time Optimal Pretty-Printing Combinators with ChoicePerspectives of System Informatics10.1007/978-3-662-46823-4_21(257-265)Online publication date: 19-Apr-2015
Bagge AHasu T(2013)A Pretty Good Formatting PipelineSoftware Language Engineering10.1007/978-3-319-02654-1_10(177-196)Online publication date: 2013
Kiselyov OPeyton-Jones SSabry A(2012)Lazy v. Yield: Incremental, Linear Pretty-PrintingProgramming Languages and Systems10.1007/978-3-642-35182-2_14(190-206)Online publication date: 2012
Swierstra SChitil O(2009)Linear, bounded, functional pretty-printingJournal of Functional Programming10.1017/S095679680800699019:1(1-16)Online publication date: 1-Jan-2009
Schrage Mvan IJzendoorn Avan der Gaag LLeijen D(2005)Haskell ready to dazzle the real worldProceedings of the 2005 ACM SIGPLAN workshop on Haskell10.1145/1088348.1088351(17-26)Online publication date: 30-Sep-2005
Baars ASwierstra SNilsson H(2004)Type-safe, self inspecting codeProceedings of the 2004 ACM SIGPLAN workshop on Haskell10.1145/1017472.1017485(69-79)Online publication date: 22-Sep-2004

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Heap recycling for lazy languages

Practical typed lazy contracts

Practical typed lazy contracts

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations