Journal article icon

Journal article

The generic approximation lemma

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 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:
Published

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Journal:
INFORMATION PROCESSING LETTERS
Volume:
79
Issue:
4
Pages:
197-201
Publication date:
2001-08-15
DOI:
ISSN:
0020-0190
URN:
uuid:207a96c9-7570-42d6-acd9-de5021c2a4e2
Source identifiers:
163492
Local pid:
pubs:163492
Language:
English
Keywords:

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP