Generic properties of datatypes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2793, Issue , 2003, Pages 97-132

  Backhouse, Roland ^a   Hoogendijk, Paul ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

POLYMORPHISM;

BURDEN OF PROOF; GENERIC PROGRAMMING; GENERIC PROPERTIES; HIGHER-ORDER; NEW DIMENSIONS; PARAMETRIC POLYMORPHISM; PARAMETRISATION; SUBSTANTIAL REDUCTION;

FUNCTIONAL PROGRAMMING;

EID: 0142157023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45191-4_3     Document Type: Article

References (14)

1. R.C. Backhouse, P. de Bruin, P. Hoogendijk, G. Malcolm, T.S. Voermans, and J. van der Woude. Polynomial relators. In M. Nivat, C.S. Rattray, T. Rus, and G. Scollo, editors, Proceedings of the 2nd Conference on Algebraic Methodology and Software Technology, AMAST'91, pages 303-326. Springer-Verlag, Workshops in Computing, 1992.
2. R.C. Backhouse, P. de Bruin, G. Malcolm, T.S. Voermans, and J. van der Woude. Relational catamorphisms. In Möller B., editor, Proceedings of the IFIP TC2/WG2.1 Working Conference on Constructing Programs from Specifications, pages 287-318. Elsevier Science Publishers B.V., 1991.
3. R.C. Backhouse, H. Doornbos, and P. Hoogendijk. Commuting relators. Available via World-Wide Web at http://www.cs.nott.ac.uk/∼rcb/MPC/papers, September 1992.
4. Richard S. Bird and Oege de Moor. Algebra of Programming. Prentice-Hall International, 1996.
5. P.J. Freyd and A. Ščedrov. Categories, Allegories. North-Holland, 1990.
6. Paul Hoogendijk and Roland Backhouse. When do datatypes commute? In Eugenio Moggi and Giuseppe Rosolini, editors, Category Theory and Computer Science, 7th International Conference, volume 1290 of LNCS, pages 242-260. Springer-Verlag, September 1997.
7. Paul Hoogendijk and Oege de Moor. Container types categorically. Journal of Functional Programming, 10(2):191-225, 2000.
8. Paul Hoogendijk. A Generic Theory of Datatypes. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1997.
9. R. Milner. A theory of type polymorphism in programming. J. Comp. Syst. Scs., 17:348-375, 1977.
10. R. Milner. The standard ML core language. Polymorphism, II(2), October 1985.
11. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
12. J. Riguet. Relations binaires, fermetures, correspondances de Galois. Bulletin de la Société Mathématique de France, 76:114-155, 1948.
13. C. Strachey. Fundamental concepts in programming languages. Lecture Notes, International Summer School in Computer Programming, Copenhagen, August 1967.
14. P. Wadler. Theorems for free! In 4'th Symposium on Functional Programming Languages and Computer Architecture, ACM, London, September 1989.