Pandora.Pattern.Object.Setoid

Documentation

data Boolean

Constructors

True

False

(&&) :: Boolean -> Boolean -> Boolean infixr 3

(||) :: Boolean -> Boolean -> Boolean infixr 9

not :: Boolean -> Boolean

bool :: a -> a -> Boolean -> a

class Setoid a where

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)

Minimal complete definition

(==)

Methods

(==) :: a -> a -> Boolean infix 4

(/=) :: a -> a -> Boolean infix 4

Instances

Setoid a => Setoid (Identity a)

Defined in Pandora.Paradigm.Basis.Identity

Methods

(==) :: Identity a -> Identity a -> Boolean

(/=) :: Identity a -> Identity a -> Boolean

Setoid a => Setoid (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(==) :: Maybe a -> Maybe a -> Boolean

(/=) :: Maybe a -> Maybe a -> Boolean

(Setoid e, Setoid a) => Setoid (Conclusion e a)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(==) :: Conclusion e a -> Conclusion e a -> Boolean

(/=) :: Conclusion e a -> Conclusion e a -> Boolean