Datatype laws without signatures

Mathematical Structures in Computer Science

Volumn 6, Issue 1, 1996, Pages 1-32

  Fokkinga, Maarten M ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

CLOSURE PROPERTY; DATATYPES; DIALGEBRAS; EQUATIONAL SPECIFICATIONS; NATURAL TRANSFORMATIONS; NATURALITY; THEOREMS FOR FREE; THEORY DEVELOPMENT;

ALGEBRA;

EID: 38149080162     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500000852     Document Type: Article

References (18)

1. Barr. M. and Wells, C. (1990) Category Theory for Computing Science, Prentice Hall.
2. Ehrig, H. and Mahr, B. (1985) Fundamentals of Equational Specification 1 - equations and initial semantics, Springer-Verlag.
3. Fokkinga, M. M. (1992) Calculate categorically! Formal Aspects ofComputing 4 (4) 673-692.
4. Fokkinga, M. M. (1992) Law and Order in Algorithmics, Ph.D. thesis, University of Twente, dept. Comp. Sc, Enschede, The Netherlands.
5. Hagino, T. (1987) Category Theoretic Approach to Data Types, Ph.D. thesis, University of Edinburgh.
6. Lehmann, D. J. (1978) On the algebra of order - extended abstract. In: 19th Symposium on the Foundations of Computer Science (FOCS), IEEE 214-220.
7. Lehmann, D. J. (1980) On the algebra of order. Journal of Computer and System Sciences 21 1-23.
8. Lehmann, D. J. and Smyth, M. B. (1981) Algebraic specification of data types: A synthetic approach. Math. Systems Theory 14 97-139.
9. Malcolm, G. (1990) Algebraic Data Types and Program Transformation, Ph.D. thesis, University of Groningen, The Netherlands.
10. Malcolm, G. (1990) Data structures and program transformation. Science of Computer Programming 14 (2-3) 255-280
11. Manes, E. G. (1987) Algebraic Theories, Graduate Text in Mathematics 26, Springer-Verlag.
12. Manes, E. G. and Arbib, M. A. (1986) Algebraic Approaches to Program Semantics, Text and Monographs in Computer Science, Springer-Verlag.
13. Meertens, L. (1986) Algorithmics - towards programming as a mathematical activity. In: de Bakker, J. W. and van Vliet, J. C. (eds.) Proceedings of the CWI Symposium on Mathematics and Computer Science, North-Holland 289-334.
14. Meertens, L. (1989) Constructing a calculus of programs. In: van de Snepscheut, J. L. A. (ed.) Mathematics of Program Construction. Springer-Verlag Lecture Notes in Computer Science 375 66-90.
15. Meijer, E., Fokkinga, M. M. and Paterson, R. (1991) Functional programming with bananas, lenses, envelopes and barbed wire. In: FPCA91: Functional Programming Languages and Computer Architecture. Springer-Verlag Lecture Notes in Computer Science 523 124-144.
16. Meijer, E. (1994) More Advice on Proving Compilers Correct: Improving Correct Compilers. (Submitted for publication)
17. Pierce, B. C. (1991) Basic Category Theory for Computer Scientists, MIT Press.
18. Wadler, P. (1989) Theorems for free! In: Functional Programming Languages and Computer Architecture: FPCA '89, Imperial College, London, ACM Press 347-359.