-
-
Then if you want a commutative group you specify two constraints. The benefit is that you can have commutative monoids which have quite a lot of use cases.
I think for brevity it should be called `…
-
So we can do things like
```
sage: C. = CombinatorialFreeModule(QQ)
```
Depends on #17035
Depends on #20403
Depends on #20405
CC: @nthiery @nbruin @fchapoton @bsalisbury1
Component: **misc**
K…
-
- [ ] relative monads
- [ ] category of containers
- [x] telescopes
- [x] logical signature == container `Valence :> Sort`, with a distinguished sort `jdg` of judgments
- [ ] category of logical signa…
-
What is the reasoning for `empty` being a failure case? I would have expected it to be an alias for `eof`.
-
When we do:
```
F := FreeMonoid(0);
```
the returned object is the free group with 0 generators, and it does not satisfy `IsFreeMonoid`.
What is worse is that if we take a quotient of `F` by the (…
-
The Monoid[M] constraint on Reducer[C,M] is too tight. Semigroup[M] is enough.
Reducer[C,M] should be changed to only require Semigroup[M].
I assume scalaz.Reducer is based on https://hackage.haskell…
gwils updated
7 years ago
-
Component: **documentation**
Author: **Marc Mezzarobba**
Branch: **[`8e47f6a`](https://github.com/sagemath/sagetrac-mirror/commit/8e47f6ad274a378244da7d0f7dffc08b4b6ae6bb)**
Reviewer: **Jeroen …
-
Is normal if potions effects still work after death?
Effects of the same potion are summarizes if use more than 1 the same potion.
-
I am seeing the following in debug.txt
`Undeclared global variable "id" accessed at .../minetest-0.4.15-dev/bin/../mods/player_monoids/init.lua:77`