Functional pearls: Deriving tidy drawings of trees

Journal of Functional Programming

Volumn 6, Issue 3, 1996, Pages 535-562

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Derivation, trees; Drawing; Upwards and downwards accumulations

Indexed keywords

EID: 3042944528     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001842     Document Type: Article

References (29)

1. Roland Backhouse (1989). An exploration of the Bird-Meertens formalism. In International Summer School on Constructive Algorithmes, Hollum, Ameland. STOP project. Also available as Technical Report CS 8810, Department of Computer Science, Groningen University, 1988.
2. Richard S. Bird (1987). An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 3-42. Springer-Verlag. Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University.
3. Richard S. Bird (1988). Lectures on constructive functional programming. In Manfred Broy, editor, Constructive Methods in Computer Science. Springer-Verlag. Also available as Technical Monograph PRG-69, from the Programming Research Group, Oxford University.
4. Anthony Bloesch (1993). Aesthetic layout of generalized trees. Software - Practice and Experience, 23(8):817-827.
5. EX: Applications, Uses, Methods, pages 185-206. Ellis Horwood.
6. Pierre Deransart, Martin Jourdan, and Bernard Lorho (1988). LNCS 323: Attribute Grammars - Definitions, Systems and Bibliography. Springer-Verlag.
7. Jeremy Gibbons, Wentong Cai, and David Skillicorn (1994). Efficient parallel algorithms for tree accumulations. Science of Computer Programming, 23:1-18.
8. Jeremy Gibbons (1991). Algebras for Tree Algorithms. D.Phil, thesis, Programming Research Group, Oxford University. Available as Technical Monograph PRG-94.
9. Jeremy Gibbons (1993a). Computing downwards accumulations on trees quickly. In Gopal Gupta, George Mohay, and Rodney Topor, editors, 16th Australian Computer Science Conference, pages 685-691, Brisbane. Revised version to appear in Theoretical Computer Science.
10. Jeremy Gibbons (1993a). Computing downwards accumulations on trees quickly. In Gopal Gupta, George Mohay, and Rodney Topor, editors, 16th Australian Computer Science Conference, pages 685-691, Brisbane. Revised version to appear in Theoretical Computer Science.
11. Jeremy Gibbons (1993b). Upwards and downwards accumulations on trees. In R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors, LNCS 669: Mathematics of Program Construction, pages 122-138. Springer-Verlag. A revised version appears in the Proceedings of the Massey Functional Programming Workshop, 1992.
12. Jeremy Gibbons (1994). How to derive tidy drawings of trees. In C. Calude, M. J. J. Lennon, and H. Maurer, editors, Proceedings of Salodays in Auckland, pages 53-73, Department of Computer Science, University of Auckland.
13. Jeremy Gibbons (1995). An initial-algebra approach to directed acyclic graphs. In B. Möller, editor, LNCS 947: Mathematics of Program Construction, pages 282-303. Springer-Verlag.
14. Jeremy Gibbons (1996). The Third Homomorphism Theorem. Journal of Functional Programming 6(4).
15. David Gries (1982). A note on a standard strategy for developing loop invariants and loops. Science of Computer Programming, 2:207-214.
16. Andrew Kennedy (1996). Drawing trees. Journal of Functional Programming, to appear.
17. Donald E. Knuth (1968). The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.
18. Donald E. Knuth (1971). Optimum binary search trees. Acta Informatica, 1:14-25.
19. Richard E. Ladner and Michael J. Fischer (1980). Parallel prefix computation. Journal of the ACM, 27(4):831-838.
20. Grant Malcolm (1990). Algebraic Data Types and Program Transformation. PhD thesis, Rijksuniversiteit Groningen.
21. Lambert Meertens (1986). Algorithmics: Towards programming as a mathematical activity. In J. W. de Bakker, M. Hazewinkel, and J. K. Lenstra, editors, Proc. CWI Symposium on Mathematics and Computer Science, pages 289-334. North-Holland.
22. G. M. Radack (1988). Tidy drawing of M-ary trees. Technical Report CES-88-24, Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, Ohio.
23. Edward M. Reingold and John S. Tilford (1981). Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223-228.
24. David B. Skillicorn (1993). Parallel evaluation of structured queries in text. Draft, Department of Computing and Information Sciences, Queen's University, Kingston, Ontario.
25. Kenneth J. Supowit and Edward M. Reingold (1983). The complexity of drawing trees nicely. Acta Informatica, 18(4):377-392.
26. Jean G. Vaucher (1980). Pretty-printing of trees. Software - Practice and Experience, 10:553-561.
27. John Q. Walker, II (1990). A node-positioning algorithm for general trees. Software - Practice and Experience, 20(7):685-705.
28. Charles Wetherell and Alfred Shannon (1979). Tidy drawings of trees. IEEE Transactions on Software Engineering, 5(5):514-520.
29. Niklaus Wirth (1976). Algorithms + Data Structures = Programs. Prentice Hall.