• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Termination of programs with strategy annotations (2003)

by S Lucas
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Polynomials for Proving Termination of Context-Sensitive Rewriting

by Salvador Lucas - 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.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University