-
There are several ideas already (in the design document) but there is no "final" decision yet.
My tendency since forever is a manual trait system meaning records + implicit parameters type 2 (no norm…
-
Currently `whenJust` has the following type signature:
```haskell
whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f ()
```
I propose to generalize types of `whenJust` and `whenJustM` fu…
-
The aim is to integrate in the main Sage library the mature methods and examples for
* H-trivial monoids
* R-trivial monoids
* L-trivial monoids
* J-trivial monoids
from the Sage-Semigroups package…
-
There is a presentation for the symmetric inverse semigroup described [here](https://core.ac.uk/download/pdf/82378951.pdf), which extends the Moore presentation for the symmetric group. The original (…
-
```
failing seed for monoid.combine all is SGFUZ_W1vdaXG1UjmoN6qgg9wwl7yimZDfxvf7fWOIG=
failing seed for StreamTests.monoid.combine all is SGFUZ_W1vdaXG1UjmoN6qgg9wwl7yimZDfxvf7fWOIG=
[info] ! Stre…
-
e.g. `CommMonoid.toMonoid`.
These are useful to see (also in the instances for `Monoid`).
-
I'm having issues with "calt" not working in some programs and need to be 100% sure it's not something wrong with my font. If one of you experts could have a look at the font http://larsenwork.com/mon…
-
There should be some kind of function, or group of functions, that take a structure with a lense, that implements a monoid action, and either an iterator of the monoid value or implements shapely for …
-
Currently, monoids, commutative monoids, groups, and commutative groups are all defined as sigma types over `setwithbinop`. I think it makes more sense to organize them as follows:
- Monoids as a si…
-
So I have this so far
```
foldr : {A B : Set} → (A → B → B) → B → List A → B
foldr f b nil = b
foldr f b (x ∷ xs) = f x (foldr f b xs)
fold-map : {A : Set} → (M : Monoid) → (A → forget M) → List A →…