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:
“You know that your toddler needed love and approval but he often seemed not to care whether he got it or not and never seemed to know how to earn it. Your pre-school child is positively asking you to tell him what does and does not earn approval, so he is ready to learn any social refinement of being human which you will teach him....He knows now that he wants your love and he has learned how to ask for it.”
—Penelope Leach (20th century)
“He’s one of those know-it-all types that, if you flatter the wig off him, he chatter like a goony bird at mating time.”
—Michael Blankfort. Lewis Milestone. Johnson (Reginald Gardner)