-
I've often found the below a useful semigroup/monoid instance for maps where `m1 m2` performs an upsert dependent on the semigroup instance of the value types. If a key exists in both `m1` and `m2` t…
-
https://hackage.haskell.org/package/base-4.7.0.1/docs/Data-Monoid.html
```
mappend mempty x = x
mappend x mempty = x
mappend x (mappend y z) = mappend (mappend x y) z
mconcat = foldr mappend mempty
`…
-
This issue is reserved for comments on the blog post [Free monoids and free monads](http://blog.higher-order.com/blog/2013/08/20/free-monads-and-free-monoids/). Leave a comment below and it will show …
-
This is an issue reserved for comments on http://blog.higher-order.com/blog/2014/03/19/monoid-morphisms-products-coproducts/
-
e.g. `CommMonoid.toMonoid`.
These are useful to see (also in the instances for `Monoid`).
-
As per the discussion on irc we should work towards inclusion of twisted functors. Besides other things I would like to bikeshed the names as well.
-
Can we perhaps have a typeclass for right monoid actions as well? Something called `RightAction` perhaps and maybe even have `LeftAction` which aliases `Action`?
-
Currently **cats** provides a `Monoid` instance for `Function0` & `Function1`: https://github.com/typelevel/cats/blob/main/kernel/src/main/scala/cats/kernel/instances/FunctionInstances.scala#L109
Whi…
-
I don't think many programs break if changes from `Doc -> Doc -> Doc` to `Monoid m => m -> m -> m`, since everything else in the library has type `Doc`. The fixity is the same between the two version…
-
> … if we change our functions **to instead to** a list of these monoidal values.
There’s something missing here, I think?