Modularity of simple termination of term rewriting systems with shared constructors
From MaRDI portal
Recommendations
- On the modularity of termination of term rewriting systems
- scientific article; zbMATH DE number 40801
- scientific article; zbMATH DE number 1479616
- Generalized sufficient conditions for modular termination of rewriting
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Cites work
- Completeness of combinations of constructor systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- scientific article; zbMATH DE number 4180808 (Why is no real title available?)
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 4047068 (Why is no real title available?)
- scientific article; zbMATH DE number 4074466 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- Modular aspects of properties of term rewriting systems related to normal forms
- Modular term rewriting systems and the termination
- On termination of the direct sum of term-rewriting systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Orderings for term-rewriting systems
- Termination for direct sums of left-linear complete term rewriting systems
Cited in
(29)- Modular aspects of term graph rewriting
- Decidability of reachability for disjoint union of term rewriting systems
- Generalized sufficient conditions for modular termination of rewriting
- Simple termination is difficult
- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Abstract data type systems
- Simple termination of rewrite systems
- Modular termination proofs for rewriting using dependency pairs
- Determinization of conditional term rewriting systems
- Modular and incremental proofs of AC-termination
- scientific article; zbMATH DE number 40801 (Why is no real title available?)
- scientific article; zbMATH DE number 1236372 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- Extension orderings
- scientific article; zbMATH DE number 759443 (Why is no real title available?)
- Completeness of combinations of constructor systems
- Simple termination is difficult
- More problems in rewriting
- On proving termination by innermost termination
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
- Combination techniques for non-disjoint equational theories
- Combinations of simplifying conditional 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
- On proving \(C_E\)-termination of rewriting by size-change termination
- Elimination transformations for associative-commutative rewriting systems
This page was built for publication: Modularity of simple termination of term rewriting systems with shared constructors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199539)
