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:
“It is an immense loss to have all robust and sustaining expletives refined away from one! At ... moments of trial refinement is a feeble reed to lean upon.”
—Alice James (1848–1892)
“Our major universities are now stuck with an army of pedestrian, toadying careerists, Fifties types who wave around Sixties banners to conceal their record of ruthless, beaverlike tunneling to the top.”
—Camille Paglia (b. 1947)