Generic functional programming with types and relations

Journal of Functional Programming

Volumn 6, Issue 1, 1996, Pages 1-28

  Bird, Richard ^a   De Moor, Oege ^a   Hoogendijk, Paul ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030557893     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800001556     Document Type: Article

References (23)

1. Aarts, C. J., Backhouse, R. C., Hoogendijk, P., Voermans, E. and Van der Woude, J. C. S. P. (1992) A relational theory of datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub/math.prog.construction.
2. Barr, M. and Wells, C. (1985) Toposes, triples and theories. Grundlehren der Math. Wissenschaften, 278. Springer-Verlag.
3. Barr, M. and Wells, C. (1990). Category Theory for Computing Science. Prentice-Hall.
4. Bird, R. S. (1987) An introduction to the theory of lists. In: Broy, M. (ed), Logic of Programming and Calculi of Discrete Design. NATO ASI Series F, 36, pp. 3-42. Springer-Verlag.
5. Bird, R. S. (1989a) Lectures on constructive functional programming. In: Broy, M. (ed), Constructive Methods in Computing Science. NATO ASI Series F, 55, pp. 151-216. Springer-Verlag.
6. Bird, R. S. (1990) A calculus of functions for program derivation. In: Turner, D. A. (ed), Research Topics in Functional Programming, pp. 287-308. University of Texas at Austin Year of Programming Series. Addison-Wesley.
7. Bird, R. and de Moor, O. (1996) The Algebra of Programming. Prentice Hall International.
8. Bird, R. S. (1989b) Algebraic identities for program calculation. The Computer J., 32: 122-126.
9. Carboni, A., Kelly, G. M. and Wood, R. J. (1991) A 2-categorical approach to geometric morphisms I. Cahiers de topologie et geometrie differentielle categoriques, 32(1): 47-95.
10. De Moor, O. (1992) Categories, relations and dynamic programming. DPhil thesis. Technical Monograph PRG-98. Computing Laboratory, Oxford University.
11. De Moor, O. (1993) Working notes on membership of data types. Unpublished manuscript.
12. Freyd, P. J. and Ščedrov, A. (1990) Categories, allegories. Mathematical Library, vol. 39. North-Holland.
13. Gibbons, J. (1991) Algebras for tree algorithms. DPhil thesis, Programming Research Group, Computing Laboratory, Oxford University.
14. Goldblatt, R. (1986) Topoi - the categorial analysis of logic. Studies in Logic and the Foundations of Mathematics, vol. 98. North-Holland.
15. Jeuring, J. (1989) Deriving algorithms on binary labelled trees. In: Apers, P. M. G., Bosman, D. and Van Leeuwen, J. (eds), Proc. sion Computing Science in the Netherlands, pp. 229-249.
16. Johnstone, P. T. (1977) Topos Theory. Academic Press.
17. Jones, M. P. (1993) A system of constructor classes: overloading and implicit higher-order polymorphism. Proc. FPCA. To appear.
18. Lehmann, D. J. and Smyth, M. B. (1981) Algebraic specification of data types: A synthetic approach. Math. Systems Theory, 14: 97-139.
19. Malcolm, G. (1990) Data structures and program transformation. Science of Computer Programming, 14: 255-279.
20. Manes, E. G. and Arbib, M. A. (1986) Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag.
21. Pierce, B. C. (1991) Basic Category Theory for Computer Scientists. MIT Press.
22. Swierstra, S. D. and De Moor, O. (1992) Virtual data structures. Proc. State-of-the-Art Seminar on Formal Program Development, Rio de Janeiro, Brazil (to appear).
23. Wadler, P. (1990) Deforestation. Theoretical Computer Science, 73(2): 231-248.