Linear, bounded, functional pretty-printing

Article English OPEN
Swierstra, S. Doaitse; Chitil, Olaf;

We present two implementations of Oppen's pretty-printing algorithm in Haskell that meet the efficiency of Oppen's imperative solution but have a simpler, clear structure. We start with an implementation that uses lazy evaluation to simulate two co-operating processes. ... View more
  • References (11)
    11 references, page 1 of 2

    Bird, Richard S. (1984). Using circular programs to eliminate multiple traversals of data. Acta inf., 21, 239-250.

    Chitil, Olaf. (2001). Pretty printing with lazy dequeues. Pages 183-201 of: Hinze, Ralf (ed), ACM Sigplan Haskell workshop. UU-CS, no. 23.

    Chitil, Olaf. (2005). Pretty printing with lazy dequeues. Transactions on programming languages and systems (TOPLAS), 27(1), 163-184.

    Chitil, Olaf. (2006). Pretty printing with delimited continuations. Technical report 4-06. Computing Laboratory, University of Kent.

    Hughes, John. (1995). The Design of a Pretty-printing Library. Jeuring, J., & Meijer, E. (eds), Advanced functional programming. LNCS, vol. 925. Springer Verlag.

    Okasaki, Chris. (1998). Purely functional data structures. Cambridge University Press.

    Oppen, Dereck C. (1980). Pretty-printing. ACM trans. program. lang. syst., 2(4), 465-483.

    Peyton Jones, Simon L. (1997). A pretty printer library in Haskell. Part of the GHC distribution at

    Swierstra, S. D., Azero Alocer, P. R., & Saraiva, J. (1999). Designing and implementing combinator languages. Pages 150-206 of: Swierstra, Doaitse, Henriques, Pedro, & Oliveira, Jos´e (eds), Advanced functional programming, third international school, AFP'98. LNCS, vol. 1608. Springer-Verlag.

    Swierstra, S. Doaitse. (2004). Linear, online, functional pretty printing (corrected and extended version). Tech. rept. UU-CS-2004-025a. Institute of Information and Computing Sciences, Utrecht University.

  • Similar Research Results (1)
    Format Unraveled (2017)
  • Metrics
Share - Bookmark