-
Spotted this refactoring opportunity that HLint doesn't warn me about:
```haskell
> f g xs = mconcat . fmap g $ xs
> :t f
f :: Monoid c => (a -> c) -> [a] -> c
> :t foldMap
foldMap :: (Foldabl…
-
Not sure how this generalises, but it would be nice if you could click on a generator and say make it a monoid.
With #522 and #523, you could do this by inserting your monoid signature and then mer…
-
We tried to solve this with @euisuny and @YaZko but I had to leave. Making a note here that
```
From ITree Require Import
Events.StateFacts.
From CTree Require Import
Bisim.
```
G…
-
This is a continuation of [1]. I attempted to build the latest version of the Macaulay2 fork of mathicgb on a powerpc machine. However, unittest hangs when it gets to GB.small.
I tried debugging it…
-
Add support for representation theory of finite semigroups. Quite some
stuff is available in the sage-combinat queue.
* #18230: basic hierarchy of categories for representations of monoids, lie alg…
-
E.g., right now we have a `Monoid[Int]` defined in the companion object for `Semigroup`.
```scala
scala> import leopards.Semigroup
scala> summon[Semigroup[Int]]
val res0: leopards.Semigroup.gi…
-
During a recent conversation between @davidchambers and I, we came up with a way to define an Applicative Const Functor that can be used to implement Lenses, without needing a Monoid up front. The con…
-
Why `MaybeZero` was used in the interface `Monoid`?
Why not `Pair>?`?
-
Tim Davis wrote:
Many algorithms use a MIN-SECOND or MIN-FIRST semiring, to find the parent in the BFS tree, for example. The MIN is not always strictly required. A faster monoid would be based on…
-
`GxB_Type_fprint` print and check a `GrB_Type`
`GxB_UnaryOp_fprint` print and check a `GrB_UnaryOp`
`GxB_BinaryOp_fprint` print and check a `GrB_BinaryOp`
`GxB_Monoid_fprint` print and check a `G…