Linear, bounded, functional pretty-printing

DOI10.1017/S0956796808006990zbMath1181.68307MaRDI QIDQ5302643

S. Doaitse Swierstra, Olaf Chitil

Publication date: 8 January 2009

Published in: Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

HaskellOppen's pretty-printing algorithm

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15)

Related Items (2)

Polynomial-Time Optimal Pretty-Printing Combinators with Choice ⋮ Shortcut fusion rules for the derivation of circular and higher-order programs

Cites Work

• Using circular programs to eliminate multiple traversals of data
• Purely Functional Data Structures

This page was built for publication: Linear, bounded, functional pretty-printing