8 May
2019
8 May
'19
2:04 a.m.
On May 8, 2019 1:56:50 AM UTC, Vanessa McHale
It's relatively easy to define foldMapA, viz.
foldMapA :: (Monoid b, Traversable t, Applicative f) => (a -> f b) -> t a -> f b foldMapA = (fmap fold .) . traverse
I've used found it useful once so far: http://hackage.haskell.org/package/dir-traverse-0.2.0.0/docs/src/System.Dire...
Cheers, Vanessa McHale
Yes, please! I have found it useful on numerous occasions.