-
There is an instance `Monoid w => MonadAccum w (AccumT w Identity)`:
https://github.com/haskell/mtl/blob/6be8cb55ca9a8bfa6111e3004e4b56b91ed5edcc/Control/Monad/Accum.hs#L163
But a more general i…
-
I think that should be fine to add. Just like the Ord Set has one: https://github.com/purescript/purescript-ordered-collections/blob/v3.0.0/src/Data/Set.purs#L83
I can prepare a PR if you agree.
-
This one is a bit painful and I am not sure there is a perfect answer but I feel like we should probably hide the monoid one and export the semigroup version. Everything in base will work, downside (i…
-
In order to prove correctness and validate edge data as well as provide a high level interface for managing state channels, we want to implement a monoid for Cells. This monoid should be able to round…
-
I'd like to see a monoid for detecting bursts in streams of data:
http://www.cs.cornell.edu/home/kleinber/bhs.pdf
/cc @johnynek
-
When adding to a stack project using the `lts-14.16` resolver, I get the following:
```
/tmp/stack-92f7a402b96815d5/hwsl2-0.4.0.1/src/Data/Hash/SL2.hs:68:10: error:
• No instance for (Semigro…
-
- verify that the binary operator of a monoid is associative
- verify that the identity element of a monoid is in fact an identity element of the binary operator and monoid domain
- validate any oth…
-
Would it be possible to get a thin variant on Monoid? Coming from Source Code Pro Light, Monoid Regular/Retina looks very thick. Thoughts?
For reference..
OS: OSX, Mavericks
App: iTerm2
Size: 12pt _…
-
```rust
struct ParsableType;
fn parser() -> impl Parser {
let parsers: [BoxedParser
-
- [x] infinity-magma
- [x] n-magma
- [x] semigroup
- [ ] ~~2-semigroup~~
- [x] monoid
- [x] commutative monoid
- [ ] ~~2-monoid~~
- [x] group
- [x] abelian group
- [ ] ~~braided 2-monoid~~
…