Polynomial-Time Optimal Pretty-Printing Combinators with Choice

DOI10.1007/978-3-662-46823-4_21zbMath1434.68221OpenAlexW612875727MaRDI QIDQ3455076

Anton Podkopaev, Dmitri Boulytchev

Publication date: 3 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46823-4_21

zbMATH Keywords

combinatorsbottom-up rewriting systemspretty-printing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Linear, bounded, functional pretty-printing

This page was built for publication: Polynomial-Time Optimal Pretty-Printing Combinators with Choice