Introduction to higher order categorical logic
Introduction to higher order categorical logic
Information and Computation
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
Towards a typed geometry of interaction
Mathematical Structures in Computer Science
Hi-index | 5.23 |
Based on the monoid classifier Δ, we give an alternative axiomatization of Freyd's paracategories, which can be interpreted in any bicategory of partial maps. Assuming furthermore a free-monoid monad T in our ambient category, and coequalisers satisfying some exactness conditions, we give an abstract envelope construction, putting paramonoids (and paracategories) in the more general context of partial algebras. We introduce for the latter the crucial notion of saturation, which characterises those partial algebras which are isomorphic to the ones obtained from their enveloping algebras. We also set up a factorisation system for partial algebras, via epimorphisms and (monic) Kleene morphisms and relate the latter to saturation.