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 generalised from lists to a large class of datatypes, and present a generi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Elsevier Science
2001
|
| Online Access: | https://eprints.nottingham.ac.uk/225/ |