Implementing conditional term rewriting by graph rewriting

DOI10.1016/S0304-3975(00)00209-7zbMath0983.68084OpenAlexW1971749487MaRDI QIDQ5958126

Enno Ohlebusch

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00209-7

zbMATH Keywords

graph rewritingterm rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modularity in noncopying term rewriting
• Conditional rewrite rules: Confluence and termination
• Computation on graph-like expressions
• Completeness results for basic narrowing
• Bisimilarity in term graph rewriting.
• A needed narrowing strategy
• The integration of functions into logic programming: From theory to practice
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides

This page was built for publication: Implementing conditional term rewriting by graph rewriting