Adhesive Categories

Abstract

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewriting on arbitrary adhesive categories. 
DOI: 10.1007/978-3-540-24727-2_20

Topics

Cite this paper

@inproceedings{Lack2004AdhesiveC, title={Adhesive Categories}, author={Stephen Lack and Pawel Sobocinski}, booktitle={FoSSaCS}, year={2004} }