Module

Test.Abides.Data.Foldable

foldMap' :: forall b a f. Foldable f => Functor f => Monoid b => Eq b => (a -> b) -> f a -> Boolean

fold (map f x) == foldMap f x

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