Pre-adjunctions in order enriched categories
- 1 July 1991
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 1 (2) , 141-158
- https://doi.org/10.1017/s0960129500001262
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.Keywords
This publication has 9 references indexed in Scilit:
- Predicate Calculus and Program SemanticsPublished by Springer Nature ,1990
- Soft adjunction between 2-categoriesJournal of Pure and Applied Algebra, 1989
- Local adjunctionsJournal of Pure and Applied Algebra, 1988
- Adjunction of semifunctors: Categorical structures in nonextensional lambda calculusTheoretical Computer Science, 1985
- Bicategories of spans and relationsJournal of Pure and Applied Algebra, 1984
- Pre-adjunctions and lambda-algebraic theoriesColloquium Mathematicum, 1984
- Coherent Extensions and Relational AlgebrasTransactions of the American Mathematical Society, 1974
- Coherent extensions and relational algebrasTransactions of the American Mathematical Society, 1974
- Formal Category Theory: Adjointness for 2-CategoriesLecture Notes in Mathematics, 1974