Rippling: Meta-level Guidance for Mathematical Reasoning

4.2: Properties Of Rippling

4.2 Properties Of Rippling

4.2.1 Preliminaries

To formalize the properties that we desire from rippling, without committing ourselves to a particular implementation, we first give an abstract presentation, assuming only the existence of certain sets and functions. Concrete formalizations will be given later.

Let a signature ?, set of variables , a set of ( unannotated) terms (= ) over ? and , and a rewrite relation ? ? be given. Our formalization of rippling is based on a set and a binary relation ? over this set. Members of are annotated terms and is the rippling relation. The requirements on and are weaker than for their unannotated counterparts. In particular, the elements of are simply elements of a set and need not be generated from a signature (so formally we are abusing the phrase term, although in practice members of often are terms or can be thought of as terms over a signature with additional restrictions). We also do not insist that is a rewriting relation. The reason for these weaker requirements will become clearer in Section 4.4.2 when we commit to a particular formalization of rippling. The rough intuition, though, is that annotation provides control information for rippling by labeling parts of terms and only restricted kinds of labelings are meaningful. It turns out that the collection of meaningfully labeled terms is a set, but not a...

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Circular Polarizers
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.