Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
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
(<=>) :: a -> a -> Ordering Source #
(<) :: a -> a -> Boolean Source #
(<=) :: a -> a -> Boolean Source #
Instances
Chain a => Chain (Maybe a) Source # | |
Chain a => Chain (Identity a) Source # | |
Defined in Pandora.Paradigm.Basis.Identity | |
(Chain a, Chain (t a)) => Chain (Jack t a) Source # | |
(Chain e, Chain a) => Chain (Conclusion e a) Source # | |
Defined in Pandora.Paradigm.Basis.Conclusion (<=>) :: Conclusion e a -> Conclusion e a -> Ordering Source # (<) :: Conclusion e a -> Conclusion e a -> Boolean Source # (<=) :: Conclusion e a -> Conclusion e a -> Boolean Source # (>) :: Conclusion e a -> Conclusion e a -> Boolean Source # (>=) :: Conclusion e a -> Conclusion e a -> Boolean Source # | |
Chain a => Chain (Tagged tag a) Source # | |
Defined in Pandora.Paradigm.Basis.Tagged | |
Chain a => Chain (Constant a b) Source # | |
Defined in Pandora.Paradigm.Basis.Constant |