On proving termination by innermost termination

DOI10.1007/3-540-61464-8_45zbMath1503.68112OpenAlexW1586360976MaRDI QIDQ5055854

Bernhard Gramlich

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61464-8_45

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Modularity in term rewriting revisited ⋮ Termination of term rewriting using dependency pairs ⋮ Some characteristics of strong innermost normalization ⋮ Modular termination proofs for rewriting using dependency pairs ⋮ ELAN from a rewriting logic point of view

Cites Work

• Unnamed Item
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• Modular termination of \(r\)-consistent and left-linear term rewriting systems
• Natural termination
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Modularity of simple termination of term rewriting systems with shared constructors
• Generalized sufficient conditions for modular termination of rewriting
• On the modularity of termination of term rewriting systems
• Modular proofs for completeness of hierarchical term rewriting systems
• Completeness of combinations of constructor systems
• On theories with a combinatorial definition of 'equivalence'
• Termination for the direct sum of left-linear term rewriting systems
• On the Church-Rosser property for the direct sum of term rewriting systems

This page was built for publication: On proving termination by innermost termination