Simple termination of rewrite systems
From MaRDI portal
Publication:1392146
DOI10.1016/S0304-3975(96)00172-7zbMath0903.68106MaRDI QIDQ1392146
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
Certified Kruskal’s Tree Theorem ⋮ Modularity in term rewriting revisited ⋮ AC-KBO revisited ⋮ Unnamed Item ⋮ Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations ⋮ Unnamed Item ⋮ Termination of term rewriting using dependency pairs ⋮ Pattern-matching algorithms based on term rewrite systems ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy ⋮ Modular termination proofs for rewriting using dependency pairs
Cites Work
- Orderings for term-rewriting systems
- Automating the Knuth Bendix ordering
- Termination of rewriting
- Counterexamples to termination for 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
- Simulation of Turing machines by a regular rewrite rule
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Generalized sufficient conditions for modular termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
- Simple termination is difficult
- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular properties of composable term rewriting systems
- Total termination of term rewriting is undecidable
- Total termination of term rewriting
- Completeness of combinations of constructor systems
- Proving termination with multiset orderings
- Extension orderings
- Simple termination revisited
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Ordering by Divisibility in Abstract Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simple termination of rewrite systems
