The generic approximation lemma
- 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 generalized 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 generalizing the approximation lemma in this way also simplifies its proof. © 2001 Elsevier Science B.V.
- Publication status:
- Publisher copy:
- Copyright date:
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record