The maximality of the typed lambda calculus and of cartesian closed categories

Kosta Došen; Zoran Petrić

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “The maximality of the typed lambda calculus and of cartesian closed categories”

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

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.