Modularity of termination in term graph rewriting
From MaRDI portal
Recommendations
Cites work
- Collapsed tree rewriting: Completeness, confluence, and modularity
- Completeness of combinations of constructor systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Generalized sufficient conditions for modular termination of rewriting
- Graph reducibility of term rewriting systems
- scientific article; zbMATH DE number 177461 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- Modular proofs for completeness of hierarchical term rewriting systems
- Modularity in noncopying term rewriting
- On the Church-Rosser property for the direct sum of term rewriting systems
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
Cited in
(14)- Modular aspects of term graph rewriting
- Modularity in term rewriting revisited
- Term rewriting on GPUs
- scientific article; zbMATH DE number 1617319 (Why is no real title available?)
- Conditional term graph rewriting with indirect sharing
- Non-simplifying graph rewriting termination
- Graph reducibility of term rewriting systems
- scientific article; zbMATH DE number 177461 (Why is no real title available?)
- scientific article; zbMATH DE number 1236372 (Why is no real title available?)
- scientific article; zbMATH DE number 1361503 (Why is no real title available?)
- Complexity of acyclic term graph rewriting
- Implementing term rewriting by graph reduction: Termination of combined systems
- On termination of graph rewriting
- From linear term rewriting to graph rewriting with preservation of termination
This page was built for publication: Modularity of termination in term graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055863)
