Generalized sufficient conditions for modular termination of rewriting
From MaRDI portal
Publication:1328180
DOI10.1007/BF01190827zbMath0810.68085MaRDI QIDQ1328180
Publication date: 4 July 1994
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Related Items (26)
On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Simple termination is difficult ⋮ Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ On proving termination by innermost termination ⋮ Modularity of termination in term graph rewriting ⋮ On the modularity of termination of term rewriting systems ⋮ Modular and incremental proofs of AC-termination ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ The theory of vaccines ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Bubbles in modularity ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Modularity in term rewriting revisited ⋮ Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems ⋮ Simple termination of rewrite systems ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ Usable Rules for Context-Sensitive Rewrite Systems ⋮ On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems ⋮ Termination is not modular for confluent variable-preserving term rewriting systems ⋮ Unnamed Item ⋮ Modular termination of prefix-constrained term rewrite systems ⋮ Modular aspects of term graph rewriting ⋮ Hierarchical termination revisited. ⋮ 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
- Orderings for term-rewriting systems
- Modular properties of conditional term rewriting systems
- Modular term rewriting systems and the termination
- Termination of rewriting
- 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
- Modularity of simple termination of term rewriting systems with shared constructors
- 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: Generalized sufficient conditions for modular termination of rewriting
