Unifying Semantic Path Order and Weighted Path Order
classification
💻 cs.LO
keywords
orderspathreductionordersemanticweighteddiscussground
read the original abstract
Monotonic semantic path orders and weighted path orders are powerful reduction orders for proving termination of term rewrite systems. In this paper we present their simple unification as reduction orders and reduction pairs. We also discuss the use of it as ground total reduction orders.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.