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

DOI10.1016/S0020-0190(99)00150-7MaRDI QIDQ1583048zbMATH OpenFDO

Authors Enno Ohlebusch

Publication date 26 October 2000

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

Full work available at URL https://doi.org/10.1016/S0020-0190(99)00150-7

zbMATH Keywords

graph rewritingmodularityterm rewritingtheory of computation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites work

• Bisimilarity in term graph rewriting.
• Collapsed tree rewriting: Completeness, confluence, and modularity
• Counterexamples to termination for the direct sum of term rewriting systems
• scientific article; zbMATH DE number 1236372 (Why is no real title available?)
• scientific article; zbMATH DE number 1088027 (Why is no real title available?)
• scientific article; zbMATH DE number 1995150 (Why is no real title available?)
• scientific article; zbMATH DE number 919844 (Why is no real title available?)
• scientific article; zbMATH DE number 1456966 (Why is no real title available?)
• Implementing term rewriting by graph reduction: Termination of combined systems
• LEAN: An intermediate language based on graph rewriting
• Modular aspects of term graph rewriting
• Modularity in noncopying term rewriting
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• On termination of the direct sum of term-rewriting systems
• Proving termination with multiset orderings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583048)