Refinement Types
In type theory, a refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. Refinement types can express preconditions when used as function arguments or postconditions when used as return types: for instance, the type of a function which accepts natural numbers and returns natural numbers greater than 5 may be written as . Refinement types are thus related to behavioral subtyping.
Read more about this topic: Refinement (computing)
Famous quotes containing the words refinement and/or types:
“Perhaps our own woods and fields,—in the best wooded towns, where we need not quarrel about the huckleberries,—with the primitive swamps scattered here and there in their midst, but not prevailing over them, are the perfection of parks and groves, gardens, arbors, paths, vistas, and landscapes. They are the natural consequence of what art and refinement we as a people have.... Or, I would rather say, such were our groves twenty years ago.”
—Henry David Thoreau (1817–1862)
“The bourgeoisie loves so-called “positive” types and novels with happy endings since they lull one into thinking that it is fine to simultaneously acquire capital and maintain one’s innocence, to be a beast and still be happy.”
—Anton Pavlovich Chekhov (1860–1904)