Implementing conditional term rewriting by graph rewriting
From MaRDI portal
Recommendations
Cites work
- A needed narrowing strategy
- Bisimilarity in term graph rewriting.
- Completeness results for basic narrowing
- Computation on graph-like expressions
- Conditional rewrite rules: Confluence and termination
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 3478840 (Why is no real title available?)
- scientific article; zbMATH DE number 1088027 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Modularity in noncopying term rewriting
- The integration of functions into logic programming: From theory to practice
Cited in
(6)- Efficient graph rewriting and its implementation
- Conditional term graph rewriting with indirect sharing
- scientific article; zbMATH DE number 4052984 (Why is no real title available?)
- scientific article; zbMATH DE number 4092746 (Why is no real title available?)
- scientific article; zbMATH DE number 1231489 (Why is no real title available?)
- scientific article; zbMATH DE number 1088027 (Why is no real title available?)
This page was built for publication: Implementing conditional term rewriting by graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958126)