Wolfram Kahl
SQRL Report No. 56
24 pages
Software Quality Research Laboratory
Department of Computing and Software
McMaster University
July 2009
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to graph transformation. Collagories closely correspond to the adhesive categories important for the categorical DPO approach to graph transformation. but thanks to their relation-algebraic flavour provide a more accessible and more flexible setting.
Relation-algebraic graph transformation, Collagories, Allegories, Pushout, Adhesive categories
A short version of this report appeared in the proceedings of RelMiCS/AKA 2009, LNCS 5827.