Module

Test.QuickCheck.Laws.Control.Apply

Package
purescript-quickcheck-laws
Repository
purescript-contrib/purescript-quickcheck-laws

#checkApply Source

checkApply :: forall f. Apply f => Arbitrary (f A) => Arbitrary (f (A -> B)) => Arbitrary (f (B -> C)) => Eq (f C) => Proxy f -> Effect Unit
  • Associative composition: (<<<) <$> f <*> g <*> h = f <*> (g <*> h)

#checkApplyGen Source

checkApplyGen :: forall f. Apply f => Eq (f C) => Gen (f A) -> Gen (f (A -> B)) -> Gen (f (B -> C)) -> 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