Online Linear Pretty Printing
Stc
ComputingScienceColloquium
Date: April 29
Time: 11:00
Room: BBL 509
Abstract
In 1980 Derek Oppen published an imperative pretty printing algorithm
(TOPLAs2, 4), that has served as a source of inspiration for
many other papers on the subject. Several people have tried to derive a similar algorithm in Haskell
(Hughes, Peyton-Jones, Wadler), but it took until 2001 before a Haskell
program meeting the same specifications was given by Olaf Chitil in the Haskell
workshop of that year.
I the talk I will sketch the original problem, present the derivation
of a solution of which I think it is simpler and much easier to
understand than Chitils's solution, and will discuss the ideas behind
Olaf Chitil's solution (which are interesting by themselves, but
probably unnecessary for this problem) and the differences with my
solution.
If you want to know more about this you may want to read the
technical report.
