On the modularity of termination of term rewriting systems

DOI10.1016/0304-3975(94)00039-LzbMath0874.68154OpenAlexW2031948276MaRDI QIDQ1349693

Enno Ohlebusch

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00039-l

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (16)

On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ On proving termination by innermost termination ⋮ Modular and incremental proofs of AC-termination ⋮ The theory of vaccines ⋮ Bubbles in modularity ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Modularity in term rewriting revisited ⋮ From diagrammatic confluence to modularity ⋮ Simple termination of rewrite systems ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Unnamed Item ⋮ Modular termination of prefix-constrained term rewrite systems ⋮ Some characteristics of strong innermost normalization ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination is not modular for confluent variable-preserving term rewriting systems
• Modular properties of conditional term rewriting systems
• Counterexamples to termination for the direct sum of term rewriting systems
• On termination of the direct sum of term-rewriting systems
• A note on simplification orderings
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Modularity of simple termination of term rewriting systems with shared constructors
• Generalized sufficient conditions for modular termination of rewriting
• Simple termination is difficult
• Completeness of combinations of constructor systems
• Proving termination with multiset orderings
• Termination for direct sums of left-linear complete term rewriting systems
• Extensions and comparison of simplification orderings
• On the Church-Rosser property for the direct sum of term rewriting systems
• Combinations of simplifying conditional term rewriting systems
• Sufficient conditions for modular termination of conditional term rewriting systems
• Termination of term rewriting by interpretation

This page was built for publication: On the modularity of termination of term rewriting systems