Container types categorically

Journal of Functional Programming

Volumn 10, Issue 2, 2000, Pages 191-225

  Hoogendijk, Paul ^a   De Moor, Oege ^b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013157536     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003640     Document Type: Article

References (46)

1. Aarts, C. J., Backhouse, R. C., Hoogendijk, P. F., Voermans, E. & Van der Woude, J. C. S. P. (1992) A relational theory of datatypes. Available from URL http://www.win.tue.nl/win/cs/wp/papers/papers.html.
2. Backhouse, R. C., De Bruin, P., Malcolm, G., Voermans, T. S. & Van der Woude, J. C. S. P. (1991) Relational catamorphisms. In: Möller, B. (ed.), Constructing Programs from Specifications, pp. 287-318. Elsevier.
3. Backhouse, R. C., Doornbos, H. & Hoogendijk, P. (1993) A class of commuting relators. Available from URL http://www.win.tue.nl/win/cs/wp/papers/papers.html.
4. Belle, G., Jay, C. B. & Moggi, E. (1996) Functorial ML. Proceedings of PLILP '96: Lecture Notes in Computer Science 1140, pp. 32-46. Springer-Verlag.
5. Bird, R. S. & De Moor, O. (1996) Algebra of Programming. International Series in Computer Science. Prentice Hall.
6. Bird, R. S., Hoogendijk, P. F. & De Moor, O. (1996) Generic programming with relations and functors. J. Functional Programming, 6(1), 1-28.
7. Brinkmann, H. B. (1969) Relations for exact categories. J. Algebra, 13, 465-480.
8. Carboni, A. & Street, R. (1986) Order ideals in categories. Pacific J Math., 124(2), 275-288.
9. Carboni, A. & Walters, R. F. C. (1987) Cartesian bicategories I. J. Pure & Appl. Algebra, 49(1-2), 11-32.
10. Carboni, A., Kasangian, S. & Street, R. (1984) Bicategories of spans and relations. J. Pure & Appl. Algebra, 33(3), 259-267.
11. Carboni, A., Kelly, G. M. & Wood, R. J. (1991) A 2-categorical approach to geometric morphisms I. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 32(1), 47-95.
12. Cockett, J. R. B. & Fukushima, T. (1991) About Charity. Technical Report 92/480/18, Department of Computer Science, University of Calgary, Canada. (Available from URL http://www.cpsc.ucalgary.ca/projects/charity/home.html.)
13. Cockett, J. R. B. & Spencer, D. (1992) Strong categorical datatypes I. In: Seely, R. A. G. (ed.), Category Theory 1991: CMS Conference Proceedings, 13, 141-169. Canadian Mathematical Society.
14. De Morgan, A. (1860) On the syllogism, no. IV, and on the logic of relations. Trans. Cambridge Philosophical Soc., 10, 331-358.
15. De Morgan, A. (1966) "On the Syllogism" and other Logical Writings. Yale University Press.
16. Doornbos, H. (1996) Reductivity Arguments and Program Construction. PhD thesis, Department of Computing Science, Eindhoven University of Technology, The Netherlands.
17. Freyd, P. J. & Ščedrov, A. (1990) Categories, Allegories. Mathematical Library, vol. 39. North-Holland.
18. Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. & Scott, D. S. (1980) A Compendium of Continuous Lattices. Springer-Verlag.
19. Grillet, P. A. (1970) Regular categories. In: Barr, M., Grillet, P. A. & Van Osdol, D. H. (eds.), Exact Categories and Categories of Sheaves: Lecture Notes in Mathematics 236, pp. 121-222. Springer-Verlag.
20. Hinze, R. (1999) Polytypic programming with ease. Technical Report IAI-TR-99-2, Institut für Informatik III, Universität Bonn.
21. Hoare, C. A. R. & He, J. (1986a) The weakest prespecification, I. Fundamenta Informaticae, 9(1), 51-84.
22. Hoare, C. A. R. & He, J. (1986b) The weakest prespecification, II. Fundamenta Informaticae, 9(2), 217-251.
23. Hoogendijk, P. F. (1996) A generic theory of datatypes. PhD thesis, Department of Computing Science, Eindhoven University of Technology, The Netherlands.
24. Hoogendijk, P. F. & Backhouse, R. C. (1997) When do datatypes commute? In: Category Theory and Computer Science: Lecture Notes in Computer Science 1290, pp. 242-260. Springer-Verlag.
25. Jay, C. B. (1994) Matrices, monads and the fast fourier transform. Proc. Massey Functional Programming Workshop, pp. 71-80.
26. Jay, C. B. (1995a) Polynomial polymorphism. In: Kotagiri, R. (ed.), Proc. 18th Australasian Computer Science Conference, pp. 237-243. Glenelg, South Australia.
27. Jay, C. B. (1995b) A semantics for shape. Science of Computer Programming, 25, 251-283.
28. Jeuring, J. & Jansson, P. (1996) Polytypic programming. In: Launchbury, J., Meijer, E. & Sheard, T. (eds.), Advanced Functional Programming, Second International School: Lecture Notes in Computer Science 1129, pp. 68-114. Springer-Verlag.
29. Jeuring, J. T. (1995) Polytypic pattern matching. In: Peyton-Jones, S. (ed.), Functional Programming Languages and Computer Architecture, pp. 238-248. ACM.
30. Kawahara, Y. (1973a) Notes on the universality of relational functors. Memoirs of the Faculty of Science, Kyushu University, Series A, Mathematics, 27(3), 275-289.
31. Kawahara, Y. (1973b) Relations in categories with pullbacks. Memoirs of the Faculty of Science, Kyushu University, Series A, Mathematics, 27(1), 149-173.
32. Kock, A. (1972) Strong functors and monoidal monads. Archiv für Mathematik, 23, 113-120.
33. Mac Lane, S. (1961) An algebra of additive relations. Proc. Nat. Academy Sci., 47, 1043-1051.
34. Maddux, R. D. (1991) The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica, 50(3-4), 421-455.
35. Manes, E. G. (1998) Implementing collection classes with monads. Math. Structures in Computer Sci., 8(3), 231-276.
36. Manes, E. G. & Arbib, M. A. (1986) Algebraic approaches to program semantics. Texts and Monographs in Computer Science. Springer-Verlag.
37. Meertens, L. (1996) Calculate polytypically! Proc. 8th Int. Symposium on Programming Languages, Implementations, Logics and Programs: Lecture Notes in Computer Science, pp. 1-16. Springer-Verlag.
38. Mitchell, J. C. & Ščedrov, A. (1993) Notes on sconing and relators. In: Boerger, E. (ed.), Computer Science Logic '92, Selected Papers: Lecture Notes in Computer Science 702, pp. 352-378. Springer-Verlag.
39. Moggi, E. (1991) Notions of computation and monads. Inform. & Computation, 93(1), 55-92.
40. Peirce, C. S. (1870) Description of a notation for the logic of relatives, resulting from an amplification of the conceptions of Boole's calculus of logic. Memoirs of the American Academy of Sciences, 9, 317-378.
41. Peirce, C. S. (1933) Collected Papers. Harvard University Press.
42. Pratt, V. R. (1992) Origins of the calculus of binary relations. Logic in Computer Science, pp. 248-254. IEEE Press.
43. Puppe, D. (1962) Korrespondenzen in Abelschen Kategorien. Mathematische Annalen, 148, 1-30.
44. Schröder, E. (1895) Vorlesungen über die Algebra der Logik (exakte logik). Dritter band: Algebra und Logik der Relative. Teubner, Leipzig. (Reprinted by Chelsea Publishing Co., New York, 1966.)
45. Tarski, A. (1941) On the calculus of relations. J. Symbolic Logic, 6(3), 73-89.
46. Tuijnman, D. (1996) A Categorical Approach to Functional Programming. PhD thesis, Department of Computer Science, University of Ulm, Germany.