Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data Top a
- topToMaybe :: Top a -> Maybe a
- pattern ValT :: t -> Top t
- pattern Top :: Top t
- data Bottom a
- bottomToMaybe :: Bottom a -> Maybe a
- pattern Bottom :: Bottom t
- pattern ValB :: t -> Bottom t
- data UnBounded a
- = MinInfinity
- | Val {
- _unUnBounded :: a
- | MaxInfinity
- unUnBounded :: forall a a. Traversal (UnBounded a) (UnBounded a) a a
- unBoundedToMaybe :: UnBounded a -> Maybe a
Documentation
`Top a` represents the type a, together with a Top
element, i.e. an element
that is greater than any other element. We can think of `Top a` being defined as:
>>>
data Top a = ValT a | Top
topToMaybe :: Top a -> Maybe a Source
`Bottom a` represents the type a, together with a Bottom
element,
i.e. an element that is smaller than any other element. We can think of
`Bottom a` being defined as:
>>>
data Bottom a = ValB
bottomToMaybe :: Bottom a -> Maybe a Source
`UnBounded a` represents the type a, together with an element
MaxInfinity
larger than any other element, and an element MinInfinity
,
smaller than any other element.
unUnBounded :: forall a a. Traversal (UnBounded a) (UnBounded a) a a Source
unBoundedToMaybe :: UnBounded a -> Maybe a Source