Adhesive categories

Stephen Lack and Pawel Sobocinski

This was presented at Foundations of Software Science and Computation Structures: 7th International Conference, FOSSACS 2004, and published in Lecture Notes in Computer Science 2987, Springer, 2004, pp. 273--288.


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.


This is available as RS-03-31 in the BRICS Report Series.


Steve Lack
Last modified: Wed Oct 13 09:11:42 EST 2004