| Copyright | (c) Erich Gut |
|---|---|
| License | BSD3 |
| Maintainer | zerich.gut@gmail.com |
| Safe Haskell | None |
| Language | Haskell2010 |
OAlg.Structure.PartiallyOrdered.Definition
Contents
Description
partial orderings..
Synopsis
- class Eq a => PartiallyOrdered a where
- class PartiallyOrdered a => Empty a where
- class PartiallyOrdered a => Full a where
Partial Ordering
class Eq a => PartiallyOrdered a where Source #
partially ordered types.
Properties Let a be an instance of PartiallyOrdered, then holds:
Instances
| PartiallyOrdered Bool Source # | |
| Ord x => PartiallyOrdered (Set x) Source # | |
| PartiallyOrdered x => PartiallyOrdered (Op x) Source # | |
| Eq x => PartiallyOrdered [x] Source # | |
Defined in OAlg.Structure.PartiallyOrdered.Definition | |
| (Ord a, Ord b) => PartiallyOrdered (Graph a (Set b)) Source # | |
class PartiallyOrdered a => Empty a where Source #
the minimal element of a patrially ordered type..
Property Let a be an instance of Empty, then for all x in a holds:
empty .<<= x
Minimal complete definition