Control.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 law:
* 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