scientific article
From MaRDI portal
Publication:4037323
zbMath0765.68065MaRDI QIDQ4037323
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20)
Related Items (24)
Term graph rewriting and garbage collection using opfibrations ⋮ Sesqui-Pushout Rewriting with Type Refinements ⋮ Lambda calculus with explicit recursion ⋮ Relational structures and their partial morphisms in view of single pushout rewriting ⋮ Polymorphic Sesqui-Pushout Graph Rewriting ⋮ Single Pushout Rewriting in Comprehensive Systems ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Unnamed Item ⋮ Relational matching for graphical calculi of relations ⋮ Properties of graphs preserved by relational graph rewritings ⋮ Grammar Morphisms and Weakly Adhesive Categories ⋮ Locating the contractum in the double pushout approach ⋮ Relational graph rewritings ⋮ Algebraic approach to single-pushout graph transformation ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Towards Secrecy for Rewriting in Weakly Adhesive Categories ⋮ Partial pushout semantics of generics in DOL ⋮ Single pushout rewriting in comprehensive systems of graph-like structures ⋮ Partial pullback complement rewriting along admissible matches ⋮ Comprehensive systems: a formal foundation for multi-model consistency management ⋮ Unnamed Item ⋮ Algebraic transformation of unary partial algebras II: Single-pushout approach ⋮ Partial pullback complement rewriting
Uses Software
This page was built for publication:
