úÎ5õ     None&!"&(*+-./0123468=?BEGHIJKMTU3A range of values from zero to one, including both.<A predicate, which ensures that the value is less than zero.?A predicate, which ensures that the value is greater than zero.RA predicate, which ensures that a value equals to the specified type-level number.XA predicate, which ensures that a value is greater than the specified type-level number.UA predicate, which ensures that a value is less than the specified type-level number.BA logical disjunction predicate, composed of two other predicates.BA logical conjunction predicate, composed of two other predicates."A logical negation of a predicate. JA class which defines a runtime interpretation of a type-level predicate p for type x. Check the value x according to the predicate p;, producing an error string if the value does not satisfy. 1A refinement type, which wraps a value of type x5, ensuring that it satisfies a type-level predicate p. A smart constructor of a  + value. Checks the input value at runtime.  Constructs a  C value with checking at compile-time using Template Haskell. E.g.,'$$(refineTH 23) :: Refined Positive Int Refined 23&Here's an example of an invalid value:&$$(refineTH 0) :: Refined Positive Int<interactive>:6:4: Value is not greater than 01 In the Template Haskell splice $$(refineTH 0)= In the expression: $$(refineTH 0) :: Refined Positive Int In an equation for it :3 it = $$(refineTH 0) :: Refined Positive IntÕIf it's not evident, the example above indicates a compile-time failure, which means that the checking was done at compile-time, thus introducing a zero runtime overhead compared to a plain value construction.Extracts the refined value.             refined-0.1.1.0Refined ZeroToOneNegativePositiveEqualTo GreaterThanLessThanOrAndNot PredicatevalidaterefinerefineTHunrefine$fPredicateEqualTox$fPredicateGreaterThanx$fPredicateLessThanx$fPredicateOrx$fPredicateAndx$fPredicateNotx $fLiftRefined $fReadRefined