Article contents
Pre-adjunctions in order enriched categories
Published online by Cambridge University Press: 04 March 2009
Abstract
Category theory offers a unified mathematical framework for the study of specifications and programs in a variety of styles, such as procedural, functional and concurrent. One way that these different languages may be treated uniformly is by generalising the definitions of some standard categorical concepts. In this paper we reproduce in the generalised theory analogues of some standard theorems on isomorphism, and outline their applications to programming languages.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1991
References
REFERENCES
- 7
- Cited by