Safe Haskell	Safe
Language	Haskell2010

Test.Abides.Properties

Synopsis

reflexive :: Eq a => a -> Bool
commutative :: Eq b => (a -> a -> b) -> a -> a -> Bool
associative :: Eq a => (a -> a -> a) -> a -> a -> a -> Bool
idempotent :: Eq a => (a -> a) -> a -> Bool
distributive :: Eq a => (a -> a) -> (a -> a -> a) -> a -> a -> Bool
distributive' :: Eq b => (a -> b) -> (a -> a -> a) -> (b -> b -> b) -> a -> a -> Bool
constL :: Eq a => (a -> a -> a) -> a -> a -> Bool
constR :: Eq a => (a -> a -> a) -> a -> a -> Bool

Documentation

x == x?

commutative :: Eq b => (a -> a -> b) -> a -> a -> Bool Source #

f x y == f y x?

associative :: Eq a => (a -> a -> a) -> a -> a -> a -> Bool Source #

f (f x y) z == f x (f y z)?

idempotent :: Eq a => (a -> a) -> a -> Bool Source #

f (f x) == f x?

distributive :: Eq a => (a -> a) -> (a -> a -> a) -> a -> a -> Bool Source #

f (g x y) == g (f x) (f y)?

distributive' :: Eq b => (a -> b) -> (a -> a -> a) -> (b -> b -> b) -> a -> a -> Bool Source #

f (g x y) == g' (f x) (f y)?

constL :: Eq a => (a -> a -> a) -> a -> a -> Bool Source #

f x y == x? Note: bottom ~ forall y. f bottom y == bottom, while unit ~ forall x. f x unit == x

constR :: Eq a => (a -> a -> a) -> a -> a -> Bool Source #

f x y == y?