The following pages link to On recursive path ordering (Q1082075):
Displaying 21 items.
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Simplification orderings: Putting them to the test (Q1311404) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- An improved general path order (Q1925013) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- A Lambda-Free Higher-Order Recursive Path Order (Q2988386) (← links)
- The computability path ordering (Q3196359) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Polymorphic higher-order recursive path orderings (Q3546327) (← links)
- (Q4219044) (← links)
- AC-KBO revisited (Q4593023) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Recursive Path Orderings Can Also Be Incremental (Q5387842) (← links)
- Proving Termination with (Boolean) Satisfaction (Q5504589) (← links)
- A Higher-Order Iterative Path Ordering (Q5505590) (← links)
- Improving associative path orderings (Q6488548) (← links)
