| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Data.Prd.Top
Synopsis
- type Bottom a = Maybe a
- type Bound a = Bottom (Top a)
- type Lifted a = Nan (Top a)
- type Lowered a = Nan (Bottom a)
- type Extended a = Nan (Bound a)
- data Top a
- top :: b -> (a -> b) -> Top a -> b
- fin :: a -> Bound a
- bound :: b -> b -> (a -> b) -> Bound a -> b
- topped :: Maximal b => (a -> b) -> Top a -> b
- lifted :: RealFloat b => (a -> b) -> Lifted a -> b
- bounded :: Bounded b => (a -> b) -> Bound a -> b
- extended :: Bounded b => b -> (a -> b) -> Extended a -> b
- isTop :: Bound a -> Bool
- isBottom :: Bound a -> Bool
- isFin :: Bound a -> Bool
- toTop :: Minimal b => (a -> b) -> Bound a -> Top b
- toBottom :: Maximal b => (a -> b) -> Bound a -> Bottom b
- liftTop :: Maximal a => (a -> b) -> a -> Top b
- liftTop' :: Maximal a => (a -> b) -> a -> Bound b
- liftBottom :: Minimal a => (a -> b) -> a -> Bottom b
- liftBottom' :: Minimal a => (a -> b) -> a -> Bound b
- liftBound :: Bounded a => (a -> b) -> a -> Bound b
- liftExtended :: Bounded a => Floating a => (a -> b) -> a -> Extended b
Documentation
Instances
bounded :: Bounded b => (a -> b) -> Bound a -> b Source #
Interpret Bound aBoundLattice of a.
This map is monotone when f is.
liftBottom :: Minimal a => (a -> b) -> a -> Bottom b Source #
liftBottom' :: Minimal a => (a -> b) -> a -> Bound b Source #