A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Improved General Path Order
1996
Applicable Algebra in Engineering, Communication and Computing
We define a strong and versatile termination order for term rewriting systems, called the Improved General Path Order, which simplifies and strengthens Dershowitz/Hoot's General Path Order. We demonstrate the power of the Improved General Path Order by proofs of termination of non-trivial examples, among them a medium-scale term rewriting system that models a lift control.
doi:10.1007/bf01293264
fatcat:qyhcmt36nzhwrexzbaa5izvh5q