| Issue |
RAIRO-Theor. Inf. Appl.
Volume 39, Number 3, July-September 2005
Foundations of Software Science and Computer Structures (FOSSECAS'04)
|
|
|---|---|---|
| Page(s) | 511 - 545 | |
| DOI | https://doi.org/10.1051/ita:2005028 | |
| Published online | 15 July 2005 | |
Adhesive and quasiadhesive categories
1
School of Quantitative Methods
and Mathematical Sciences, University of Western Sydney, Australia.
2
BRICS, University of Aarhus, Denmark; pawel@brics.dk
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.
Mathematics Subject Classification: 18A30 / 18A35 / 18D99 / 68Q42 / 68Q65
Key words: Adhesive categories / quasiadhesive categories / extensive categories / category theory / graph rewriting
© EDP Sciences, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.