Adhesive and quasiadhesive categories

Stephen Lack; Pawel Sobociński

doi:10.1051/ita:2005028

Adhesive and quasiadhesive categories

Stephen Lack^*, Pawel Sobociński

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

189 Citations (Scopus)

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.

Original language	English
Pages (from-to)	511-545
Number of pages	35
Journal	RAIRO - Theoretical Informatics and Applications
Volume	39
Issue number	3
DOIs	https://doi.org/10.1051/ita:2005028
Publication status	Published - Jul 2005
Externally published	Yes

Keywords

Adhesive categories
Category theory
Extensive categories
Graph rewriting
Quasiadhesive categories

Access to Document

10.1051/ita:2005028

Cite this

@article{10f52ba621d4407c994d17511fc28ddb,

title = "Adhesive and quasiadhesive categories",

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.",

keywords = "Adhesive categories, Category theory, Extensive categories, Graph rewriting, Quasiadhesive categories",

author = "Stephen Lack and Pawel Soboci{\'n}ski",

year = "2005",

month = jul,

doi = "10.1051/ita:2005028",

language = "English",

volume = "39",

pages = "511--545",

journal = "RAIRO - Theoretical Informatics and Applications",

issn = "0988-3754",

publisher = "EDP Sciences",

number = "3",

}

TY - JOUR

T1 - Adhesive and quasiadhesive categories

AU - Lack, Stephen

AU - Sobociński, Pawel

PY - 2005/7

Y1 - 2005/7

N2 - 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.

AB - 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.

KW - Adhesive categories

KW - Category theory

KW - Extensive categories

KW - Graph rewriting

KW - Quasiadhesive categories

UR - https://www.scopus.com/pages/publications/22944475309

U2 - 10.1051/ita:2005028

DO - 10.1051/ita:2005028

M3 - Article

AN - SCOPUS:22944475309

SN - 0988-3754

VL - 39

SP - 511

EP - 545

JO - RAIRO - Theoretical Informatics and Applications

JF - RAIRO - Theoretical Informatics and Applications

IS - 3

ER -

Adhesive and quasiadhesive categories

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this