Nested datatypes

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

Volumn 1422, Issue , 1998, Pages 52-67

  Bird, Richard ^a   Meertens, Lambert ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

DATA TYPE; DATATYPES; FUNCTORIAL SEMANTICS; NESTED DATATYPES; STANDARD THEORIES;

FUNCTIONAL PROGRAMMING;

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

References (20)

1. R. Bird and O. de Moor. Algebra of Programming. International Series in Computing Science. Prentice Hall, 1996.
2. R. S. Bird, P. F. Hoogendijk, and O. De Moor. Generic programming with relations and functors. Journal of Functional Programming, 6(1):1-28, 1996.
3. R.H. Connelly and F. Lockwood Morris. A generalisation of the trie data structure. Mathematical Structures in Computer Science, 5(3):381-418, 1995.
4. Oege de Moor and Paul Hoogendijk. What is a datatype? Technical Report 96/16, Department of Maths and Computing Science, Eindhoven University of Technology, 1996.
5. Paul Hoogendijk. A Generic theory of Data Types. Ph.D Thesis, Eindhoven University of Technology, 1997.
6. L. Fegaras and T. Sheard. Revisiting catamorphisms over datatypes with embedded functions. In 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Association for Computing Machinery, 1996.
7. Peter Freyd. Algebraically complete categories. Springer-Vertag Lecture Notes in Mathematics, vol 1488, 95-104, 1990.
8. T. Hagino. Category theoretic approach to data types. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, UK, 1987. Technical Report ECS-LFCS-87-38.
9. J. Jeuring. Polytypic pattern matching. In S. Peyton Jones, editor, Functional Programming and Computer Architecture, pages 238-248. Association for Computing Machinery, 1995.
10. J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103:151-161, 1968.
11. Saunders MacLane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer-Verlag, 1971.
12. G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14(2-3):255-279, 1990.
13. G. Malcolm. Algebraic Data Types and Program Transformation. Ph.D thesis, University of Groningen, The Netherlands, 1990.
14. E.G. Manes and M.A. Arbib. Algebredc Approaches to Program Semantics. Texts and Monographs in Computing Science. Springer-Verlag, 1986.
15. Lambert Meertens. Calculate polytypically! In Herbert Kuchen and S. Doaitse Swierstra, editors, Programming Languages: Implementations Logics, and Programs Proceedings Eighth International Symposium PLILP’96, volume 1140 of LNCS, pages 1-16. Springer-Verlag, 1996.
16. E. Meijer and G. Hutton. Bananas in space: extending fold and unfold to exponential types. In S. Peyton Jones, editor, Functional Progamming Languages and Computer Architecture, pages 324-333. Association for Computing Machinery, 1995.
17. A. Mycroft. Polymorphic type schemes and recursive definitions. In International Symposium on Programming, volume LNCS 167, pages 217-228. Springer-Verlag, 1984.
18. C. Okasaki. Purely Functional Data Structures. Ph.D thesis, School of Computer Science, Carnegie Mellon University, 1996.
19. C. Okasaki. Catenable double-ended queues. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP’97), pages 66-74. ACM, 1997.
20. S. Peyton Jones and J. Launchbury. Explicit quantification in Haskell. See: http://www.dcs.gla.ac.uk/people/peraonal/simonpj/.