Adhesive and quasiadhesive categories

Stephen Lack*, Pawel Sobociński

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

163 Citations (Scopus)


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 languageEnglish
Pages (from-to)511-545
Number of pages35
JournalRAIRO - Theoretical Informatics and Applications
Issue number3
Publication statusPublished - Jul 2005
Externally publishedYes


  • Adhesive categories
  • Category theory
  • Extensive categories
  • Graph rewriting
  • Quasiadhesive categories


Dive into the research topics of 'Adhesive and quasiadhesive categories'. Together they form a unique fingerprint.

Cite this