The design of a pretty-printing library Export

@incollection{citeulike:3079241, abstract = {In this chapter we have considered the design of combinator libraries. We saw how studying the algebraic properties of the combinators desired can both help to suggest natural choices of representation, and guide the implementation of the operators. We saw several examples — lists, monads, and a pretty-printing library. For this kind of program development we need a language with higher-order functions and lazy evaluation, for which equational reasoning is valid; in other words, Haskell is ideally suited.}, author = {Hughes, John}, citeulike-article-id = {3079241}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-59451-5_3}, citeulike-linkout-1 = {http://www.springerlink.com/content/p60r715152v41206}, doi = {10.1007/3-540-59451-5_3}, journal = {Advanced Functional Programming}, keywords = {agda, copy, haskell}, pages = {53--96}, posted-at = {2008-08-04 02:58:46}, priority = {2}, title = {The design of a pretty-printing library}, url = {http://dx.doi.org/10.1007/3-540-59451-5_3}, year = {1995} }

TY - CHAP ID - citeulike:3079241 L3 - citeulike-article-id:3079241 N2 - In this chapter we have considered the design of combinator libraries. We saw how studying the algebraic properties of the combinators desired can both help to suggest natural choices of representation, and guide the implementation of the operators. We saw several examples — lists, monads, and a pretty-printing library. For this kind of program development we need a language with higher-order functions and lazy evaluation, for which equational reasoning is valid; in other words, Haskell is ideally suited. JF - Advanced Functional Programming EP - 96 TI - The design of a pretty-printing library SP - 53 KW - agda KW - copy KW - haskell AU - Hughes, John PY - 1995/// UR - http://dx.doi.org/10.1007/3-540-59451-5_3 ER -