Conference
Collagories for Relational Adhesive Rewriting
Abstract
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.
Authors
Kahl W
Series
Lecture Notes in Computer Science
Volume
5827
Pagination
pp. 211-226
Publisher
Springer Nature
Publication Date
2009
DOI
10.1007/978-3-642-04639-1_15
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743