Author:
Podkopaev Anton,Boulytchev Dmitri
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Aho, A.V., Ganapathi, M., Tjiang, S.W.K.: Code generation using tree matching and dynamic programming. ACM Trans. Program. Lang. Syst. 11(4), 491–516 (1989)
2. Azero, P., Swierstra, S.D.: Optimal Pretty-Printing Combinators.
http://www.cs.ruu.nl/groups/ST/Software/PP,
(1998)
3. Lecture Notes in Computer Science;SD Swierstra,1999
4. Chitil, O.: Pretty printing with lazy dequeues. ACM Trans. Program. Lang. Syst. 27, 163–184 (2005)
5. Comon, H., Dauchet, M., Gilleron, R. et al.: Tree Automata Techniques and Applications.
http://www.grappa.univ-lille3.fr/tata,
(2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Pretty Expressive Printer;Proceedings of the ACM on Programming Languages;2023-10-16
2. A pretty but not greedy printer (functional pearl);Proceedings of the ACM on Programming Languages;2017-08-29