An improved general path order

DOI10.1007/BF01293264zbMath0858.68049MaRDI QIDQ1925013

Alfons Geser

Publication date: 27 October 1996

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

term rewriting systemsimproved general path order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Termination of constructor systems ⋮ An improved general path order ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Natural termination ⋮ Shallow confluence of conditional term rewriting systems

Cites Work

• Orderings for term-rewriting systems
• Natural termination
• Termination by completion
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• Counterexamples to termination for the direct sum of term rewriting systems
• A note on simplification orderings
• Simulation of Turing machines by a regular rewrite rule
• An improved general path order
• Proving termination with multiset orderings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item