Adhesive categories

Stephen Lack, Pawel Sobociński

Research output: Contribution to journalArticlepeer-review

119 Citations (Scopus)

Abstract

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are wellbehaved. 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.

Original languageEnglish
Pages (from-to)273-288
Number of pages16
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2987
Publication statusPublished - 2004
Externally publishedYes

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

Cite this