Pushout-complements and basic concepts of grammars in toposes
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
Van Kampen colimits as bicolimits in span
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Amalgamating pushout and pullback graph transformation in collagories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Dependently-typed formalisation of relation-algebraic abstractions
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
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.