Polynomials for Proving Termination of Context-Sensitive Rewriting

@inproceedings{Lucas2004PolynomialsFP,
  title={Polynomials for Proving Termination of Context-Sensitive Rewriting},
  author={Salvador Lucas},
  booktitle={FoSSaCS},
  year={2004}
}
We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termination proofs) can, then, be gradually introduced in the interpretations to deal with different applications. For instance, the dependency pairs method for proving termination of rewriting, and some restrictions of the rewrite relation which are not monotonic in all arguments of the function symbols, can benefit from this… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Generating Polynomial Orderings

Inf. Process. Lett. • 1994
View 4 Excerpts
Highly Influenced

On proving term rewriting systems are noetherian

D. S. Lankford
Technical Report, Louisiana Technological University, Ruston, LA, • 1979
View 5 Excerpts
Highly Influenced

Termination

H. Zantema
In TeReSe, editor, Term Rewriting Systems, chapter 6. Cambridge University Press, • 2003
View 2 Excerpts

Simple termination of context-sensitive rewriting

ACM SIGPLAN Workshop on Rule-Based Programming • 2002
View 10 Excerpts

Termination Proofs for Rewriting Using Dependency Pairs

J. Giesl, T. Arts, E. Ohlebusch Modula
Journal of Symbolic Computation 38:21-58, • 2002
View 1 Excerpt

and J

T. Art
Giesl. Termination of Term Rewriting Using Dependency Pairs Theoretical Computer Science, 236:133-178, • 2000
View 1 Excerpt

Context-sensitive Computations in Functional and Functional Logic Programs

Journal of Functional and Logic Programming • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…