Module

Test.QuickCheck.Laws

Package: purescript-quickcheck-laws
Repository: garyb/purescript-quickcheck-laws

#A Source

newtype A

Constructors

A Ordering

Instances

#B Source

newtype B

Constructors

B Ordering

Instances

#C Source

newtype C

Constructors

C Ordering

Instances

#D Source

newtype D

Constructors

D Ordering

Instances

#E Source

newtype E

Constructors

E Ordering

Instances

#checkLaws Source

checkLaws :: String -> Effect Unit -> Effect Unit

Modules: Test.QuickCheck.Laws; Test.QuickCheck.Laws.Control; Test.QuickCheck.Laws.Control.Alt; Test.QuickCheck.Laws.Control.Alternative; Test.QuickCheck.Laws.Control.Applicative; Test.QuickCheck.Laws.Control.Apply; Test.QuickCheck.Laws.Control.Bind; Test.QuickCheck.Laws.Control.Category; Test.QuickCheck.Laws.Control.Comonad; Test.QuickCheck.Laws.Control.Extend; Test.QuickCheck.Laws.Control.Monad; Test.QuickCheck.Laws.Control.MonadPlus; Test.QuickCheck.Laws.Control.MonadZero; Test.QuickCheck.Laws.Control.Plus; Test.QuickCheck.Laws.Control.Semigroupoid; Test.QuickCheck.Laws.Data; Test.QuickCheck.Laws.Data.BooleanAlgebra; Test.QuickCheck.Laws.Data.Bounded; Test.QuickCheck.Laws.Data.BoundedEnum; Test.QuickCheck.Laws.Data.CommutativeRing; Test.QuickCheck.Laws.Data.DivisionRing; Test.QuickCheck.Laws.Data.Eq; Test.QuickCheck.Laws.Data.EuclideanRing; Test.QuickCheck.Laws.Data.Field; Test.QuickCheck.Laws.Data.Foldable; Test.QuickCheck.Laws.Data.Functor; Test.QuickCheck.Laws.Data.FunctorWithIndex; Test.QuickCheck.Laws.Data.HeytingAlgebra; Test.QuickCheck.Laws.Data.Monoid; Test.QuickCheck.Laws.Data.Ord; Test.QuickCheck.Laws.Data.Ring; Test.QuickCheck.Laws.Data.Semigroup; Test.QuickCheck.Laws.Data.Semiring