ˌbodʲɪˈɡrʲim
ˌbodʲɪˈɡrʲim
Yes, absolutely.
It’s available from https://hackage.haskell.org/package/semirings-0.5.3/docs/Data-Euclidean.html#v:gcd
Except that `Math.Polynomial` [does not compile](https://matrix.hackage.haskell.org/#/package/polynomial) against four last versions of GHC? ;) Is something missing from [poly](http://hackage.haskell.org/package/poly), which I suggested above?
Yep, exactly.
@CarlEdman I agree with both your points. I think that working with rational coefficients is probably simpler from the theoretical viewpoint, but we may just as well (and IMHO preferably)...
1. I have not been following the evolution of Liquid Haskell, but I don't think that these invariants are easily expressible. 2. Even if Sinquid (or other code generator) would...
We can probably use PARI/GP as a reference and generate some unit tests.
> I should read this closer, because this bound does not seem to exist for certain equations, If you are quoting page 5, then this bound is conditional by _y_.
Moving them out is a good idea, I think.
`CubicSymbol` is also fine from my perspective. But representing cubic symbols directly as `EisensteinInteger` is probably painful because of the lack of exhausting pattern matching. IMO we can iron out...