Affordable Access

The Generic Approximation Lemma

Authors
Publisher
Elsevier Science
Publication Date

Abstract

The approximation lemma is a simplification of the well-known take lemma, and is used to prove properties of programs that produce lists of values. We show how the approximation lemma, unlike the take lemma, can naturally be generalised from lists to a large class of datatypes, and present a generic approximation lemma that is parametric in the datatype to which it applies. As a useful by-product, we find that generalising the approximation lemma in this way also simplifies its proof.

There are no comments yet on this publication. Be the first to share your thoughts.