Termination of term rewriting by interpretation
From MaRDI portal
Publication:5881183
DOI10.1007/3-540-56393-8_12OpenAlexW2100025438MaRDI QIDQ5881183
Publication date: 9 March 2023
Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56393-8_12
Related Items (7)
Termination of term rewriting by interpretation ⋮ Linear interpretations by counting patterns ⋮ A termination ordering for higher order rewrite systems ⋮ On the modularity of termination of term rewriting systems ⋮ Simple termination is difficult ⋮ Simple termination revisited ⋮ Total termination of term rewriting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination of rewriting
- Counterexamples to termination for the direct sum of term rewriting systems
- Proof of termination of the rewriting system SUBSET on CCL
- Proving termination with multiset orderings
- Explicit substitutions
- Simulation of Turing machines by a left-linear rewrite rule
- Extensions and comparison of simplification orderings
- Total termination of term rewriting
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Termination of term rewriting by interpretation
This page was built for publication: Termination of term rewriting by interpretation
