-
### Steps To Reproduce
```
sage: from sage.monoids.indexed_free_monoid import IndexedFreeMonoid
sage: L=['a','b','c']
sage: F=IndexedFreeMonoid(L)
sage: F
Free monoid indexed by {'a', 'b', 'c'…
-
The documentation for the lazy version says
> m :+: n is the coproduct of monoids m and n. Values of type m :+: n consist of alternating lists of m and n values.
That much is true, in the intern…
-
Reducers model append and prepend operations on Monoidal containers.
[Described on slide 9 of this talk by Kmett](http://comonad.com/reader/wp-content/uploads/2009/08/IntroductionToMonoids.pdf)
See …
-
Hi, I'm Julie Moronuki, an author of [Haskell Programming from First Principles](http://haskellbook.com/). I have a background in linguistics and philosophy, including logic, and have been a teacher o…
-
```
sage: cartesian_product([GF(3)^2, GF(7)^3])
The cartesian product of (
Vector space of dimension 2 over Finite Field of size 3,
Vector space of dimension 3 over Finite Field of size 7)
sage…
-
It sounds like type class constraints might not affect instance selection. We should confirm that claim and add to the "language/Type-Classes.md" document.
Claimed here: https://purescript-users.ml…
-
Draft in finite-semigroup-nt.patch in the Sage-Combinat queue.
Some notes:
```
class Semigroups.TransformationModules: # or .SetsWithAction
"""modules where the action is by discrete transform…
-
Hi there
I'd like to use something like view::reduce, view::accumulate to express lazy reductions of regular monoids or semigroups.
How can this be done? For a basic example, let's just say we w…
-
Monoids in `coq-ext-lib` are defined as follow:
https://github.com/coq-community/coq-ext-lib/blob/ee71d144bd2a171532d9243198538c93aebb8a58/theories/Structures/Monoid.v#L11-L14
Is there a special r…
-
I'm not sure this is a bug, it's possible my types are not quite right, or that I've used access modifiers the wrong way.
# Steps to Reproduce
Download the attached [unstable-import.zip](https://g…