Module

Test.QuickCheck.Laws.Control.MonadPlus

checkMonadPlus :: forall m. MonadPlus m => Arbitrary (m A) => Arbitrary (m B) => Eq (m B) => Proxy m -> Effect Unit

checkMonadPlusGen :: forall m. MonadPlus m => Eq (m B) => Gen (m A) -> Gen (A -> m B) -> 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.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.Enum; 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