Results 1 -
1 of
1
Polynomials for Proving Termination of Context-Sensitive Rewriting
- In Proc. of FOSSACS’04, LNCS 2987:318-332
, 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 dierent applications. ..."
Abstract
-
Cited by 21 (15 self)
- Add to MetaCart
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 dierent applications.

