A uniform framework for term and graph rewriting applied to combined systems

DOI10.1016/S0020-0190(99)00150-7zbMath0953.68560MaRDI QIDQ1583048

Enno Ohlebusch

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

graph rewritingterm rewritingtheory of computationmodularity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• Modularity in noncopying term rewriting
• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• Modular aspects of term graph rewriting
• LEAN: An intermediate language based on graph rewriting
• Bisimilarity in term graph rewriting.
• Proving termination with multiset orderings
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Implementing term rewriting by graph reduction: Termination of combined systems

This page was built for publication: A uniform framework for term and graph rewriting applied to combined systems