Total termination of term rewriting
From MaRDI portal
Publication:1912706
DOI10.1007/BF01191381zbMath0847.68054MaRDI QIDQ1912706
Hans Zantema, Maria C. F. Ferreira
Publication date: 14 May 1996
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
The order types of termination orderings on monadic terms, strings and multisets, Termination modulo equations by abstract commutation with an application to iteration, Simple termination of rewrite systems, Relative undecidability in term rewriting. I: The termination hierarchy, Relative undecidability in term rewriting. II: The confluence hierarchy, Total termination of term rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Modular properties of conditional term rewriting systems
- Termination of rewriting
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Termination of term rewriting: Interpretation and type elimination
- Total termination of term rewriting
- Proving termination with multiset orderings
- Accessible Independence Results for Peano Arithmetic
- The order types of termination orderings on monadic terms, strings and multisets