Using rippling for equational reasoning

Hutter, Dieter

doi:10.1007/3-540-61708-6_54

Search citation statements

Order By: Relevance

Paper Sections

Select...

First Order Annotations and Rippling1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1997

2010

Publication Types

Select...

Article3

Book1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is a heuristic that was originally tailored for use with induction but has also been used for summing series [29], limit theorems [30], proofs in logical frameworks [24] and equational theories [15]. It guides the application of rewriting by a process of meta-level annotation of the object-level terms.…”

Section: First Order Annotations and Ripplingmentioning

confidence: 99%

The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling

Dennis

Green²,

Smaill

2010

J Autom Reasoning

View full text Add to dashboard Cite

Rippling is a proof search guidance technique with particular application to proof by mathematical induction. It is based on a concept of annotating the differences between two terms. In its original formulation this annotation was only appropriate to first-order formulae. We use a notion of embedding to adapt these annotations appropriately for higher-order syntax. This representation simplifies the theory of annotated terms, no longer requiring special substitution and unification theorems. A key feature of the representation is that it provides a clean separation of the term and the annotation. We illustrate this with selected examples using our implementation of these ideas in λClam.

show abstract

Section: First Order Annotations and Ripplingmentioning

confidence: 99%