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 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.
منابع مشابه
On the Hamkins approximation property
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author’s thesis of a model with no ω2-Aronszajn trees, and also the “Key Lemma” in Hamkins’s gap forcing theorems. The new lemma directly yields Hamkins’s newer lemma stating that certain forcing notions have the approximation property. According to Hamkins [2], a partial ordering P sati...
متن کاملFitting’s Lemma for Z/2-graded Modules
Let φ : Rm → Rd be a map of free modules over a commutative ring R. Fitting’s Lemma shows that the “Fitting ideal,” the ideal of d × d minors of φ, annihilates the cokernel of φ and is a good approximation to the whole annihilator in a certain sense. In characteristic 0 we define a Fitting ideal in the more general case of a map of graded free modules over a Z/2graded skew-commutative algebra a...
متن کاملApproximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes
The question addressed in this paper is how to correctly approximate infinite data given by systems of simultaneous corecursive definitions. We devise a categorical framework for reasoning about regular datatypes, that is, datatypes closed under products, coproducts and fixpoints. We argue that the right methodology is on one hand coalgebraic (to deal with possible nontermination and infinite d...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملDistance scales , embeddings , and metrics of negative type ∗
We introduce a new number of new techniques for the construction of low-distortion embeddings of a finite metric space. These include a generic Gluing Lemma which avoids the overhead typically incurred from the näıve concatenation of maps for different scales of a space. We also give a significantly improved and quantitatively optimal version of the main structural theorem of Arora, Rao, and Va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 79 شماره
صفحات -
تاریخ انتشار 2001