The category of typed graph grammars and its adjunctions with categories of derivations
From MaRDI portal
Publication:4645267
DOI10.1007/3-540-61228-9_79zbMath1412.68099OpenAlexW149770690MaRDI QIDQ4645267
Ugo Montanari, Andrea Corradini, Hartmut Ehrig, Michael Löwe, Julia Padberg
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_79
Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Grammars and rewriting systems (68Q42)
Related Items
Unfolding semantics of graph transformation ⋮ Grammar Morphisms and Weakly Adhesive Categories ⋮ Graph Transformations for the Specification of Access Control Policies ⋮ Graph-based specification of access control policies ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
Cites Work