/monad-from-applicative

Verifying that Traversable and Monoid Functor can be a Mond.

Primary LanguageHaskell

Verifying the lemma: 

Lemma. If a Functor which is both Traversable and Monoid, the Functor can be a Monad.