Locating the contractum in the double pushout approach

DOI10.1016/0304-3975(94)00301-4zbMath0872.68077OpenAlexW1995569542MaRDI QIDQ672236

Richard Banach

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00301-4

zbMATH Keywords

algebraic graph rewritingdouble pushout graph rewritingterm graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Regular relations and bicartesian squares ⋮ The contractum in algebraic graph rewriting

Cites Work

• Term graph rewriting and garbage collection using opfibrations
• LEAN: An intermediate language based on graph rewriting
• Pushout-Properties: An analysis of gluing constructions for graphs
• Parallelism and concurrency in high-level replacement systems
• Canonical derivations for high-level replacement systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locating the contractum in the double pushout approach