ANN: wl-pprint-1.0: Wadler/Leijen pretty printer
Announcing wl-pprint-1.0, the classic Wadler / Leijen pretty printing combinators, now in 100% easier to use Cabalised form! Synopsis: PPrint is an implementation of the pretty printing combinators described by Philip Wadler (1997). In their bare essence, the combinators of Wadler are not expressive enough to describe some commonly occurring layouts. The PPrint library adds new primitives to describe these layouts and works well in practice. The library is based on a single way to concatenate documents, which is associative and has both a left and right unit. This simple design leads to an efficient and short implementation. The simplicity is reflected in the predictable behaviour of the combinators which make them easy to use in practice. Hackage-Url: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/wl-pprint-1.0 Darcs: http://members.cox.net/stefanor/wl-pprint/ Original-Docs: http://www.cs.uu.nl/~daan/pprint.html Stefan
Why should I use PPrint instead of the PJ/Hughes pretty printer that comes with Haskell? Thanks, Joel On Apr 15, 2007, at 8:19 PM, Stefan O'Rear wrote:
PPrint is an implementation of the pretty printing combinators described by Philip Wadler (1997). In their bare essence, the combinators of Wadler are not expressive enough to describe some commonly occurring layouts. The PPrint library adds new primitives to describe these layouts and works well in practice.
On Mon, Apr 16, 2007 at 12:10:01AM +0100, Joel Reymont wrote:
On Apr 15, 2007, at 8:19 PM, Stefan O'Rear wrote:
PPrint is an implementation of the pretty printing combinators described by Philip Wadler (1997). In their bare essence, the combinators of Wadler are not expressive enough to describe some commonly occurring layouts. The PPrint library adds new primitives to describe these layouts and works well in practice.
Why should I use PPrint instead of the PJ/Hughes pretty printer that comes with Haskell?
Wadler designed these combinators specifically in response to Hughes' paper, and they are simpler in several ways. There is fundamentally only one type of concatenation, indentation is always non-negative, etc. Stefan
Stefan O'Rear <stefanor <at> cox.net> writes:
Announcing wl-pprint-1.0, the classic Wadler / Leijen pretty printing combinators, now in 100% easier to use Cabalised form!
Hackage-Url: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/wl-pprint-1.0 Darcs: http://members.cox.net/stefanor/wl-pprint/ Original-Docs: http://www.cs.uu.nl/~daan/pprint.html
Goody! UU.PPrint is now on hackage! Regrettably, this does seem like a bit of a waste of time, as UU.PPrint was already cabalised as part of the Haskell Utrecht Tools at http://www.cs.uu.nl/wiki/HUT/ which also contains the parser combinators and DData, Daan Leijen's datastructure library. Doei, Arthur. (Who thinks Utrecht does too little marketing of its code :))
participants (3)
-
Arthur van Leeuwen -
Joel Reymont -
Stefan O'Rear