Total termination of term rewriting

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)

zbMATH Keywords

term rewriting systemsproving terminationtotal termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (12)

Proof-theoretic analysis of termination proofs ⋮ Total termination of term rewriting ⋮ A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Simple termination of rewrite systems ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ Unnamed Item ⋮ The order types of termination orderings on monadic terms, strings and multisets ⋮ Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy

Uses Software

• REVE

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

This page was built for publication: Total termination of term rewriting