论文信息 - Electronic Category Theory

Electronic Category Theory

This paper describes some experiments in using algebraic and categorical ideas to write programs. In particular a program to compute colimits in a category given coproducts and coequalisers has been written, also one to ‘lift’ such colimits to comma categories. The discussion is informal and aims to show how categorical concepts can be painlessly realised in computational practice.

Rod M. Burstall | R. Burstall

[1] Joseph A. Goguen,et al. The Semantics of CLEAR, A Specification Language , 1979, Abstract Software Specifications.

[2] Rod M. Burstall,et al. Programming in POP-2 , 1971 .

[3] Rod M. Burstall,et al. HOPE: An experimental applicative language , 1980, LISP Conference.

[4] Herbert A. Klaeren,et al. An abstract software specification technique based on structural recursion , 1980, SIGP.

[5] Joseph A. Goguen,et al. Putting Theories Together to Make Specifications , 1977, IJCAI.

[6] Harry G. Barrow,et al. SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .

[7] Hartmut Ehrig,et al. Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[8] Peter J. Landin,et al. PROGRAMS AND THEIR PROOFS: AN ALGEBRAIC APPROACH, , 1968 .

[9] S. Maclane,et al. Categories for the Working Mathematician , 1971 .

[10] Donald Michie,et al. Machine Intelligence 4 , 1970 .

[11] Hartmut Ehrig,et al. Deriving Structures from Structures , 1978, MFCS.

[12] John W. Backus,et al. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[13] Susanna Ginali,et al. A Categorical Approach to General Systems , 1978 .