On the modularity of confluence of constructor-sharing term rewriting systems
From MaRDI portal
Recommendations
Cited in
(17)- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Simple termination of rewrite systems
- A uniform framework for term and graph rewriting applied to combined systems
- Layer systems for confluence -- formalized
- Modularity in term rewriting revisited
- From diagrammatic confluence to modularity
- Completeness of combinations of constructor systems
- Layer systems for proving confluence
- Modular Church-Rosser Modulo
- Problems in rewriting III
- Compositional term rewriting: An algebraic proof of Toyama's theorem
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Proving confluence in the confluence framework with confident
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Modularity in noncopying term rewriting
- Termination is not modular for confluent variable-preserving term rewriting systems
This page was built for publication: On the modularity of confluence of constructor-sharing term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954455)