Linear, bounded, functional pretty-printing Export

@article{citeulike:6101118, abstract = {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.}, address = {New York, NY, USA}, author = {Swierstra, S. Doaitse and Chitil, Olaf}, citeulike-article-id = {6101118}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1520299}, citeulike-linkout-1 = {http://dx.doi.org/10.1017/S0956796808006990}, doi = {10.1017/S0956796808006990}, issn = {0956-7968}, journal = {J. Funct. Program.}, keywords = {functional-programming, language-haskell, pretty-printer}, number = {1}, pages = {1--16}, posted-at = {2009-11-12 10:21:43}, priority = {2}, publisher = {Cambridge University Press}, title = {Linear, bounded, functional pretty-printing}, url = {http://dx.doi.org/10.1017/S0956796808006990}, volume = {19}, year = {2009} }

TY - JOUR ID - citeulike:6101118 L3 - citeulike-article-id:6101118 N2 - 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. IS - 1 JF - J. Funct. Program. SN - 0956-7968 AD - New York, NY, USA EP - 16 TI - Linear, bounded, functional pretty-printing PB - Cambridge University Press VL - 19 SP - 1 KW - functional-programming KW - language-haskell KW - pretty-printer AU - Swierstra, Doaitse AU - Chitil, Olaf PY - 2009/// UR - http://dx.doi.org/10.1017/S0956796808006990 ER -