Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Journal Article

A Calculus for and Termination of Rippling


Basin,  David A.
Programming Logics, MPI for Informatics, Max Planck Society;


Walsh,  Toby
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Basin, D. A., & Walsh, T. (1996). A Calculus for and Termination of Rippling. Journal of Automated Reasoning, 16(1/2), 147-180.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABBB-7
Rippling is a type of rewriting developed for inductive theorem proving that uses annotations to direct search. In this paper we give a new and more general formalization of rippling. We introduce a simple calculus for rewriting annotated terms, close in spirit to first-order rewriting, and prove that it has the formal properties desired of rippling. We then develop the criteria for proving the termination of such annotated rewriting, and introduce orders on annotated terms that lead to termination. In addition, we show how to make rippling more flexible by adapting the termination orders to the problem domain. Our work has practical as well as theoretical advantages: it has led to a very simple implementation of rippling that has been integrated in the Edinburgh CLAM system.