L
*^*->*
law1
comonadTrans
monadTrans
law2
comonadTrans
monadTrans
laws
align
applicative
apply
arrow
associative
bifoldable
bifunctor
bind
bindRec
bitraverse
category
cobind
comonad
compose
contravariant
divide
divisible
enum
equal
foldable
foldable1
functor
invariantFunctor
isEmpty
lens
monad
monadError
monadPlus
monadPlusStrong
monadState
monoid
order
plus
plusEmpty
profunctor
representable
semigroup
traverse
traverse1
zip
lawsWithCount
bindRec
left
*^*->*
leftFM1Consistent
foldable1
leftFMConsistent
bifoldable
foldable
leftIdentity
category
divisible
monad
monoid
leftPlusIdentity
plusEmpty
leftRight
associative
leftZero
monadPlus
lens
ScalazLaw
scalazlaws
lensDoubleSet
ScalazLaw
lensIdentity
ScalazLaw
lensRetention
ScalazLaw