Generic downwards accumulations

Science of Computer Programming

Volumn 37, Issue 1, 2000, Pages 37-65

  Gibbons, Jeremy ^a  

^a OXFORD BROOKES UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

GENERIC PROGRAMMING; POLYTYPIC PROGRAMMING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0033733393     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(99)00022-2     Document Type: Article

References (24)

1. Bird R.S., de Moor Oege, Hoogendijk P. Generic functional programming with types and relations. J. Funct. Programm. 6(1):1996;1-28.
2. R.S. Bird, The promotion and accumulation strategies in transformational programming, ACM Trans. Programm. Languages Systems 6 (4) (1994) 487-504, see also [3].
3. Bird R.S. Addendum to the promotion and accumulation strategies in transformational programming. ACM Trans. Programm. Languages Systems. 7(3):1985;490-492.
4. R.S. Bird, An introduction to the theory of lists, in: M. Broy (Ed.), Logic of Programming and Calculi of Discrete Design, Springer, Berlin, 1987, pp. 3-42. Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University.
5. Bird R.S., Gibbons J., Jones G. Formal derivation of a pattern matching algorithm. Sci. Comput. Programm. 12(2):1989;93-104.
6. M.M. Fokkinga, E. Meijer, Program calculation properties of continuous algebras, Technical Report CS-R9104, CWI, Amsterdam, January 1991.
7. J. Gibbons, Algebras for Tree Algorithms, D. Phil. Thesis, Programming Research Group, Oxford University, 1991. Available as Technical Monograph PRG-94.
8. J. Gibbons, Upwards and downwards accumulations on trees, in: R.S. Bird, C.C. Morgan, J.C.P. Woodcock (Eds.), Lecture Notes in Computer Science 669: Mathematics of Program Construction, Springer, Berlin, 1993, pp. 122-138. A revised version appears in the Proceedings of the Massey Functional Programming Workshop, 1992.
9. Gibbons J. Deriving tidy drawings of trees. J. Funct. Programm. 6(3):1996;535-562.
10. Gibbons J. Polytypic downwards accumulations. Jeuring Johan Lecture Notes in Computer Science 1422. Proceedings of Mathematics of Program Construction, Marstrand, Sweden:June 1998;Springer, Berlin.
11. J. Gibbons, G. Jones, The under-appreciated unfold, in Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, pp. 273-279.
12. P. Hoogendijk, A generic theory of datatypes, Ph.D. Thesis, TU Eindhoven, 1997.
13. Hoogendijk P., Backhouse R. When do datatypes commute? Moggi Eugenio, Rosolini Guiseppe Lecture Notes in Computer Science. September 1997;242-260 Springer, Berlin.
14. P. Jansson, J. Jeuring, PolyP - polytypic programming language extension, in Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997, pp. 470-482.
15. Ladner R.E., Fischer M.J. Parallel prefix computation. J. ACM. 27(4):1980;831-838.
16. MacLeod I.A. A query language for retrieving information from hierarchical text structures. Comput. J. 34(3):1991;254-264.
17. Malcolm G. Data structures and program transformation. Sci. Comput. Programm. 14:1990;255-279.
18. L. Meertens, First steps towards the theory of rose trees, CWI, Amsterdam; IFIP Working Group 2.1 working paper 592 ROM-25, 1988.
19. Meertens L. Paramorphisms. Formal Aspects Comput. 4(5):1992;413-424.
20. J. Peterson, K. Hammond, L. Augustsson, B. Boutel, W. Burton, J. Fasel, A.D. Gordon, J. Hughes, P. Hudak, T. Johnsson, M. Jones, E. Meijer, S. Peyton Jones, A. Reid, P. Wadler, The Haskell 1.4 report. http://www.haskell.org/report/ , April 1997.
21. Reingold E.M., Tilford J.S. Tidier drawings of trees. IEEE Trans. Software Eng. 7(2):1981;223-228.
22. Reynolds J.C. Semantics of the domain of flow diagrams. J ACM. 24(3):1977;484-503.
23. D. Skillicorn, Foundations of parallel programming, Number six in International Series on Parallel Computation, Cambridge University Press, Cambridge, 1994.
24. P. Wadler, Theorems for free! in: Functional Programming Languages and Computer Architecture, ACM, 1989, pp. 347-359.