Adhesive and quasiadhesive categories


Lack, Stephen and Sobocinski, Pawel (2005) Adhesive and quasiadhesive categories Theoretical Informatics and Applications, 39, (2), pp. 522-546.

This is the latest version of this item.

Download

[img] PDF adhesivejournal.pdf - Other
Restricted to Registered users only

Download (213kB)

Description/Abstract

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Item Type: Article
ISSNs: 0988-3754 (print)
Related URLs:
Keywords: adhesive categories, quasiadhesive categories, graph transformation, rewriting
Organisations: Electronic & Software Systems
ePrint ID: 263599
Date :
Date Event
2005Published
Date Deposited: 23 Feb 2007
Last Modified: 17 Apr 2017 19:50
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/263599

Available Versions of this Item

Actions (login required)

View Item View Item