-
-
### Steps To Reproduce
Discovered while working on #37705
```sage
sage: E = EllipticCurve(GF(103), [3, 5])
....: S = E.point_homset(); S
Abelian group of points on Elliptic Curve defined by …
-
Most linear data structures require a way to enforce and maintain their uniqueness. And we have a few different ways to satisfy this requirement (see #130). However, some typeclass functions does not …
-
-
_From [pumpkingod@gmail.com](https://code.google.com/u/pumpkingod@gmail.com/) on May 10, 2012 21:03:05_
It looks like Agda supports qualified infix identifiers now, which is great. However, I've noti…
-
Sage's catalogs (of groups, monoids, algebras, crystals, ...) are very handy. However it takes quite some time to maintain them, and this won't scale in the long run: we would want to have similar c…
-
I executed `cabal undate` and `cabal install HLearn-algebra` but it keeps trying to install ConstraintKinds-1.1.0.0 which always fails. This is strange since in the repository it asks for >=1.2.0 .
-
I kind of tried to look at doing this like two years ago, and hopefully I'm smarter now than I was then.
My vision is this: We need some sort of minor-vs-major distinction so that we can ensure that …
-
I've started using Algebird in conjunction with Google Dataflow, which works great! My main data structure is a deeply nested case class that is implicitly a monoid – it contains a bunch of stuff, mai…
dasch updated
5 years ago
-
It would be nice to support well-typed-by-construction expression types, such as [nested abstract syntax](https://math.unice.fr/~ah/div/fsubwf.pdf) where we have `expr : Type -> Type`, we label both v…