Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Pandora.Pattern.Object.Chain
Documentation
class Setoid a => Chain a where Source #
When providing a new instance, you should ensure it satisfies the three laws: * Reflexivity: x <= x ≡ True * Transitivity: x <= y && y <= z ≡ True ===> x <= z ≡ True * Antisymmetry: x <= y && y <= x ≡ True ===> x == y ≡ True
Minimal complete definition
Methods
(<=>) :: a -> a -> Ordering infixl 4 Source #
(<) :: a -> a -> Boolean infixl 4 Source #
(<=) :: a -> a -> Boolean infixl 4 Source #