Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
When providing a new instance, you should ensure it satisfies the four laws: * Reflexivity: x == x ≡ True * Symmetry: x == y ≡ y == x * Transitivity: x == y && y == z ≡ True ===> x == z ≡ True * Negation: x /= y ≡ not (x == y)
Instances
Setoid a => Setoid (Maybe a) Source # | |
Setoid a => Setoid (Identity a) Source # | |
(Setoid a, forall b. Setoid b => Setoid (t b)) => Setoid (Twister t a) Source # | |
(Setoid a, Setoid b) => Setoid (Product a b) Source # | |
(Setoid a, Setoid (t a)) => Setoid (Jack t a) Source # | |
(Setoid e, Setoid a) => Setoid (Conclusion e a) Source # | |
Defined in Pandora.Paradigm.Basis.Conclusion (==) :: Conclusion e a -> Conclusion e a -> Boolean Source # (/=) :: Conclusion e a -> Conclusion e a -> Boolean Source # | |
Setoid a => Setoid (Tagged tag a) Source # | |
Setoid a => Setoid (Constant a b) Source # | |
(forall (u' :: k2 -> Type). Setoid ((u' :.: t u') a)) => Setoid (Y t u a) Source # | |
Setoid ((u :.: t) a) => Setoid (T t u a) Source # | |