An improved general path order
From MaRDI portal
Publication:1925013
DOI10.1007/BF01293264zbMATH Open0858.68049MaRDI QIDQ1925013FDOQ1925013
Authors: Alfons Geser
Publication date: 27 October 1996
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Recommendations
- A Higher-Order Iterative Path Ordering
- Improving associative path orderings
- On recursive path ordering
- Recursive Path Orderings Can Also Be Incremental
- Certified Higher-Order Recursive Path Ordering
- Graph path orderings
- scientific article; zbMATH DE number 3921960
- Iterative Lexicographic Path Orders
- Publication:4938603
- Order preserving reductions and polynomial improving paths
Cites Work
- Proving termination with multiset orderings
- Orderings for term-rewriting systems
- Title not available (Why is that?)
- Termination of rewriting
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on simplification orderings
- An improved general path order
- Natural termination
- On the recursive decomposition ordering with lexicographical status and other related orderings
- Path of subterms ordering and recursive decomposition ordering revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination by completion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulation of Turing machines by a regular rewrite rule
- Title not available (Why is that?)
Cited In (9)
- Improving associative path orderings
- A Higher-Order Iterative Path Ordering
- An improved general path order
- Termination of constructor systems
- Jumping and escaping: modular termination and the abstract path ordering
- Title not available (Why is that?)
- Shallow confluence of conditional term rewriting systems
- Weighted Path Orders Are Semantic Path Orders
- Natural termination
This page was built for publication: An improved general path order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925013)