Functional pearls: Drawing trees

Journal of Functional Programming

Volumn 6, Issue 3, 1996, Pages 527-534

  Kennedy, Andrew J ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042861046     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001830     Document Type: Article

References (10)

1. Bird, R. and Wadler, P. (1988) Introduction to Functional Programming. Prentice Hall.
2. Gibbons, J. (1991) Algebras for Tree Algorithms. DPhil thesis, Oxford University Computing Laboratory.
3. Gibbons, J. (1996) Deriving tidy drawings of trees. J. Functional Programming. This issue.
4. Milner, R., Tofte, M. and Harper, R. (1989) The Definition of Standard ML. MIT Press.
5. Paulson, L. C. (1991) ML for the Working Programmer. Cambridge University Press.
6. Radack, G. M. (1988) Tidy drawing of M-ary trees. Technical Report CES-88-24, Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, OH, November.
7. Reingold, E. M. and Tilford, J. S. (1981) Tidier drawings of trees. IEEE Trans. Software Engineering, 7(2):223-228, March.
8. Vaucher, J. G. (1980) Pretty-printing of trees. Software - Practice and Experience, 10:553-561.
9. Walker II, J. Q. (1990) A node-positioning algorithm for general trees. Software-Practice and Experience, 20(7):685-705, July.
10. Wetherell, C. and Shannon, A. (1979) Tidy drawings of trees. IEEE Trans. Software Engineering, 5(5):514-520, September.