| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
NumHask.Algebra.Ordering
Contents
Description
A bit of extra Ordering taken from gaia.
- class POrd s where
- data POrdering
- class POrd s => Topped s where
- class POrd s => Bottomed s where
- class (Topped a, Bottomed a) => Bounded a
- class (Lattice a, Isomorphic (Inf a) (Sup a)) => Negated a where
- class (Associative a, Commutative a, Idempotent a) => Semilattice a
- class (Coercible a (Sup a), Coercible a (Inf a), Semilattice (Sup a), Semilattice (Inf a), POrd a) => Lattice a where
- ord2pord :: Ordering -> POrdering
lattice
P's just to avoid name clashes
Minimal complete definition
Equal to, Less than, Greater than, Not comparable to
class (Topped a, Bottomed a) => Bounded a Source #
Replaces the Bounded in base. Is this a good idea?
class (Lattice a, Isomorphic (Inf a) (Sup a)) => Negated a where Source #
which creates a nice alternative for negate
class (Associative a, Commutative a, Idempotent a) => Semilattice a Source #
Semilattice