Computing with categories
This paper shows how the constructions involved in category theory may be turned into computer programs. Key issues are the computational representation of categories and of universal properties. The approach is illustrated with a program for computing finite limits of an arbitrary category; this is written in the functional programming language ML. We have developed such programs for a number of categorical constructions.
KeywordsCategory Theory Universal Property Finite Limit Finite Graph Terminal Object
Unable to display preview. Download preview PDF.
- [Burstall 80]Burstall, R.M. 1980 Electronic Category Theory Proc. of Math. Found. of Comp. Sci. Symp. Rydzyna, Poland (Invited Paper)Google Scholar
- [Constable et al 86]Constable, R.L. et al (1986) Implementing Mathematics with the Nuprl Proof Development System Prentice-Hall.Google Scholar
- [Goguen et al 84]Goguen, J.A. and Burstall, R.M. (1984) Fundamental algebraic tools for the semantics of computation, Part I. Theoretical Computer Science, 31, pp. 175–209.Google Scholar
- [Harper et al 86]Harper, R., MacQueen, D. and Milner, R. (1986) Standard ML LFCS Report Series: ECS-LFCS-86-2, Dept. of Computer Science, University of Edinburgh.Google Scholar
- [Mac Lane 71]Mac Lane, S. (1981) Categories for the working Mathematician Springer-Verlag, New York (page 46).Google Scholar
- [Rydeheard 81]Rydeheard, D.E. (1981) Applications of Category Theory to Programming and Program Specification Ph.D. Thesis, University of Edinburgh.Google Scholar
- [Rydeheard et al 86]Rydeheard, D.E. and Burstall, R.M. (1986) Computational Category Theory, book in preparation.Google Scholar
- [Sannella 82]Sannella, D.T. (1982) Semantics, Implementation and Pragmatics of Clear, A Program Specification Language Ph.D. Thesis, University of Edinburgh.Google Scholar