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