[Haskell-cafe] Tutorial/slides on pretty-printing combinators?

[Tony Sloane]

On 17/11/2011, at 12:31 AM, Jerzy Karczmarczuk wrote:

> Sean Leather:
>> Do you know of any tutorial or slides from a talk on one of the pretty-printing libraries?
>> 
> Sean, if you need info just on Haskell solutions, other people will help you. There is a paper:
> "Linear, bounded, functional pretty-printing" by Doaitse Swierstra and Olaf Chitil (and "Pretty Printer with Lazy Deques" by Olaf, a Functional Pearl if I am not mistaken). BTW, something has been implemented in Scala based on the S. and C. approach.

Yes, our Scala port of the continuation-based version from Doaitse and Olaf's paper is in the Kiama library:

http://code.google.com/p/kiama
http://code.google.com/p/kiama/source/browse/src/org/kiama/util/PrettyPrinter.scala

Some brief slides from a short fpsyd talk on this part of Kiama are at http://code.google.com/p/kiama/wiki/Research.

regards,
Tony