Linear, bounded, functional pretty-printing

S.D. Swierstra, O. Chitil

    Research output: Contribution to journalArticleAcademicpeer-review


    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 and a clear structure. We start with an implementation that uses lazy evaluation to simulate two co-operating processes. Then we present an implementation that uses higher-order functions for delimited continuations to simulate co-routines with explicit scheduling.
    Original languageUndefined/Unknown
    Pages (from-to)1-16
    Number of pages16
    JournalJournal of Functional Programming
    Issue number01
    Publication statusPublished - 2009


    • Wiskunde en Informatica (WIIN)

    Cite this