When do datatypes commute?

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

Volumn 1290, Issue , 1997, Pages 242-260

  Hoogendijk, Paul ^a   Backhouse, Roland ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PROBLEM ORIENTED LANGUAGES;

CATEGORY THEORY; DATATYPES; HIGHER-ORDER; NATURALITY; POINT-FREE; POLYTYPIC PROGRAMMING;

FUNCTIONAL PROGRAMMING;

EID: 84949199241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026992     Document Type: Conference Paper

References (18)

1. R. Backhouse, H. Doornbos, and P. Hoogendijk. Commuting relators. Available via World-Wide Web at http://www.win.tue.nl/cs/wp/papers, September 1992.
2. R. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, pages 151-216. Springer-Verlag, 1989. NATO ASI Series, vol. F55.
3. R. Bird, O. de Moor, and P. Hoogendijk. Generic functional programming with types and relations. J. of Functional Programming, 6(l):28, January 1996.
4. R. S. Bird and O. de Moor. Algebra of Programming. Prentice-Hal International, 1996.
5. H. Doornbos and R. Backhouse. Reductivity. Science of Computer Programming, 26(l-3):217-236, 1996.
6. P. Freyd and A. Scedrov. Categories, Allegories. North-Holland, 1990.
7. P. Hoogendijk. A Generic Theory of Datatypes. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1997.
8. P. Hoogendijk and O. de Moor. What is a datatype? Technical Report 96/16, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1996. Submitted to Science of Computer Programming. Available via World-Wide Web at http://OTW.win.tue.nl/cs/wp/papers.
9. J. Jeuring. Polytypic pattern matching. In Conference Record of FPCA '95, SIGPLAN-SJGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture, pages 238-248, 1995.
10. J. Jeuring and P. Jansson. Polytypic programming. In J. Launchbury, E. Meijer, and T. Sheard, editors, Proceedings of the Second International Summer School on Advanced Functional Programming Techniques, pages 68-114. Springer-Verlag, 1996. LNCS 1129.
11. A. Jung (Editor). Domains and denotational semantics: History, accomplishments and open problems. Bulletin of the European Association for Computer Science, 59:227-256, June 1996.
12. G. Malcolm. Homomorphisms and promotability. In J. van de Snepscheut, editor, Conference on the Mathematics of Program Construction, pages 335-347. Springer-Verlag LNCS 375, 1989.
13. L. Meertens. Calculate poly typically! In H. Kuchen and S. D. Swierstra, editors, Proceedings of the Eighth International Symposium PLILP '96 Programming Languages: Implementations, Logics and Programs, volume 1140 of Lecture Notes in Computer Science, pages 16. Springer Verlag, 1996.
14. E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In FPCA91: Functional Programming Languages and Computer Architecture, volume 523 of LNCS, pages 124-144. Springer-Verlag, 1991.
15. R. Milner. A theory of type polymorphism in programming. J. Comp. Syst. Scs., 17:348-375, 1977.
16. E. Moggi. Notions of computation and monads. Information and Computation, 93(l):55-92, 1991.
17. G. D. Plotkin. Lambda-definability in the full type hierarchy. In J. Seldin and J. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, London, 1980.
18. J. Reynolds. Types, abstraction and parametric polymorphism. In R. Mason, editor, IFIP '83, pages 513-523. Elsevier Science Publishers, 1983.