Displaying 41 – 60 of 91

Showing per page

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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.

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2010)

RAIRO - Theoretical Informatics and Applications

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.

Currently displaying 41 – 60 of 91