Module
Test.StrongCheck.Laws.Control.Applicative
- Package
- purescript-strongcheck-lawsDEPRECATED
- Repository
- garyb/purescript-strongcheck-laws
#checkApplicative Source
checkApplicative :: forall f. Applicative f => Arbitrary (f A) => Arbitrary (f (A -> B)) => Arbitrary (f (B -> C)) => Eq (f A) => Eq (f B) => Eq (f C) => Proxy2 f -> Effect Unit
- Identity:
(pure id) <*> v = v
- Composition:
(pure (<<<)) <*> f <*> g <*> h = f <*> (g <*> h)
- Homomorphism:
(pure f) <*> (pure x) = pure (f x)
- Interchange:
u <*> (pure y) = (pure ($ y)) <*> u
- Modules
- Test.
StrongCheck. Laws - Test.
StrongCheck. Laws. Control - Test.
StrongCheck. Laws. Control. Alt - Test.
StrongCheck. Laws. Control. Alternative - Test.
StrongCheck. Laws. Control. Applicative - Test.
StrongCheck. Laws. Control. Apply - Test.
StrongCheck. Laws. Control. Bind - Test.
StrongCheck. Laws. Control. Category - Test.
StrongCheck. Laws. Control. Comonad - Test.
StrongCheck. Laws. Control. Extend - Test.
StrongCheck. Laws. Control. Monad - Test.
StrongCheck. Laws. Control. MonadPlus - Test.
StrongCheck. Laws. Control. MonadZero - Test.
StrongCheck. Laws. Control. Plus - Test.
StrongCheck. Laws. Control. Semigroupoid - Test.
StrongCheck. Laws. Data - Test.
StrongCheck. Laws. Data. BooleanAlgebra - Test.
StrongCheck. Laws. Data. Bounded - Test.
StrongCheck. Laws. Data. CommutativeRing - Test.
StrongCheck. Laws. Data. DivisionRing - Test.
StrongCheck. Laws. Data. Eq - Test.
StrongCheck. Laws. Data. EuclideanRing - Test.
StrongCheck. Laws. Data. Field - Test.
StrongCheck. Laws. Data. Functor - Test.
StrongCheck. Laws. Data. HeytingAlgebra - Test.
StrongCheck. Laws. Data. Monoid - Test.
StrongCheck. Laws. Data. Ord - Test.
StrongCheck. Laws. Data. Ring - Test.
StrongCheck. Laws. Data. Semigroup - Test.
StrongCheck. Laws. Data. Semiring