Modularity of simple termination of term rewriting systems with shared constructors

DOI10.1016/0304-3975(92)90015-8zbMath0753.68053OpenAlexW2004551119MaRDI QIDQ1199539

Masahito Kurihara, Azuma Ohuchi

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90015-8

zbMATH Keywords

terminationmodularity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (23)

Decidability of reachability for disjoint union of term rewriting systems ⋮ Generalized sufficient conditions for modular termination of rewriting ⋮ On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Simple termination is difficult ⋮ More problems in rewriting ⋮ On proving termination by innermost termination ⋮ On the modularity of termination of term rewriting systems ⋮ Modular proofs for completeness of hierarchical term rewriting systems ⋮ Modular and incremental proofs of AC-termination ⋮ Elimination transformations for associative-commutative rewriting systems ⋮ Determinization of conditional term rewriting systems ⋮ Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems ⋮ Abstract data type systems ⋮ Simple termination of rewrite systems ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Modularity in noncopying term rewriting ⋮ Extension orderings ⋮ Simple termination is difficult ⋮ Unnamed Item ⋮ Combination techniques for non-disjoint equational theories ⋮ Completeness of combinations of constructor systems ⋮ Modular aspects of term graph rewriting ⋮ Modular termination proofs for rewriting using dependency pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Modular term rewriting systems and the termination
• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Termination for direct sums of left-linear complete term rewriting systems
• Modular aspects of properties of term rewriting systems related to normal forms
• Completeness of combinations of constructor systems
• On the Church-Rosser property for the direct sum of term rewriting systems

This page was built for publication: Modularity of simple termination of term rewriting systems with shared constructors