Categorical programming with abstract data types

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

Volumn 1548, Issue , 1998, Pages 406-421

  Erwig, Martin ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; MAPPING; SOFTWARE ENGINEERING;

ALGEBRAIC DATA-TYPES; BIALGEBRAS; COALGEBRAS; COMMON CARRIERS; PROGRAM OPTIMIZATION; PROGRAMMING STYLES;

ABSTRACT DATA TYPES;

EID: 84958979608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_29     Document Type: Conference Paper

References (26)

1. J. Backus. Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs. Communications of the ACM, 21:613-641, 1978.
2. M. Barr and C. Wells. Category Theory for Computing Science. Prentice-Hall International, 1996.
3. R. S. Bird. Lectures on Constructive Functional Programming. In M. Broy, editor, Constructive Methods in Computer Science, NATO ASI Series, Vol. 55, pages 151-216, 1989.
4. R. S. Bird and O. de Moor. The Algebra of Programming. Prentice-Hall International, 1997.
5. T.-R. Chuang. A Functional Perspective of Array Primitives. In 2nd Fuji Int. Workshop on Functional and Logic Programming, pages 71-90, 1996.
6. P. F. Dietz. Fully Persistent Arrays. In Workshop on Algorithms and Data Struc-tures, LNCS 382, pages 67-74, 1989.
7. H. Dybkjær. Category Theory, Types, and Programming Laguages. PhD thesis, University of Copenhagen, 1991.
8. M. Erwig. Functional Programming with Graphs. In 2nd ACM Int. Conf. on Functional Programming, pages 52-65, 1997.
9. M. M. Fokkinga. Law and Order in Algorithmics. PhD thesis, University of Twente, 1992.
10. M. M. Fokkinga. Datatype Laws without Signatures. Mathematical Structures in Computer Science, 6:1-32, 1996.
11. T. Fukushima and C. Tuckey. Charity User Manual, January 1996.
12. J. Gibbons. An Initial Algebra Approach to Directed Acyclic Graphs. In Mathe-matics of Program Construction, LNCS 947, pages 282-303, 1995.
13. A. Gill, J. Launchbury, and S. L. Peyton Jones. A Short Cut to Deforestation. In Conf. on Functional Programming and Computer Architecture, pages 223-232, 1993.
14. T. Hagino. A Categorical Programming Language. PhD thesis, University of Edinburgh, 1987.
15. T. Hagino. Codatatypes in ML. Journal of Symbolic Computation, 8:629-650, 1993.
16. Z. Hu, H. Iwasaki, and M. Takeichi. Deriving Structural Hylomorphisms from Recursive Definitions. In 1st ACM Int. Conf. on Functional Programming, pages 73-82, 1996.
17. Z. Hu, H. Iwasaki, M. Takeichi, and A. Takano. Tupling Calculation Eliminates Multiple Data Traversals. In 2nd ACM Int. Conf. on Functional Programming, pages 164-175, 1997.
18. J. T. Jeuring. Theories for Algorithm Calculation. PhD thesis, University of Utrecht, 1993.
19. D. J. Lehmann and M. B. Smyth. Algebraic Specification of Data Types: A Synthetic Approach. Mathematical Systems Theory, 14:97-139, 1991.
20. G. Malcolm. Homomorphisms and Promotability. In Mathematics of Program Construction, LNCS 375, pages 335-347, 1989.
21. L. Meertens. Algorithmics-Towards Programming as a Mathematical Activity. In CWI Symp. on Mathematics and Computer Science, pages 289-334, 1986.
22. E. Meijer, M. Fokkinga, and R. Paterson. Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In Conf. on Functional Programming and Computer Architecture, pages 124-144, 1991.
23. M. E. O'Neill and F. W. Burton. A New Method for Functional Arrays. Journal of Functional Programming, 7(5):487-513, 1997.
24. J.J.M.M. Rutten. Universal Coalgebra: a Theory of Systems. Report CS-R9652, CWI, Department of Software Technology, 1996.
25. T. Sheard and L. Fegaras. A Fold for all Seasons. In Conf. on Functional Pro-gramming and Computer Architecture, pages 233-242, 1993.
26. A. Takano and E. Meijer. Shortcut Deforestation in Calculational Form. In Conf. on Functional Programming and Computer Architecture, pages 306-313, 1995.