Linear, bounded, functional pretty-printing

DOI10.1017/S0956796808006990MaRDI QIDQ5302643zbMATH OpenFDO

Authors S. Doaitse Swierstra, Olaf Chitil

Publication date 8 January 2009

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

Full work available at URL https://doi.org/10.1017/S0956796808006990

zbMATH Keywords

HaskellOppen's pretty-printing algorithm

Mathematics Subject Classification ID

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

Recommendations

• Polynomial-time optimal pretty-printing combinators with choice
• Bridging the algorithm gap: A linear-time functional program for paragraph formatting
• FliPpr: a prettier invertible printing system
• Functional Pearls
• Polytypic data conversion programs

Cites work

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

Cited in

(5)

• Shortcut fusion rules for the derivation of circular and higher-order programs
• Bridging the algorithm gap: A linear-time functional program for paragraph formatting
• scientific article; zbMATH DE number 2088935 (Why is no real title available?)
• Polynomial-time optimal pretty-printing combinators with choice
• FliPpr: a prettier invertible printing system

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302643)