You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Int64 is not a EuclideanRing. It can’t pass the checkEuclideanRingGen test because mod is only lawful if the divisor is in the 32-bit Int range.
Maybe we should remove the EuclideanRing instance, since it’s a lie? Then Int64 would not have the div and modEuclideanRing methods, and instead would have only the truncating division functions quot and rem.
Int64
is not aEuclideanRing
. It can’t pass thecheckEuclideanRingGen
test becausemod
is only lawful if the divisor is in the 32-bitInt
range.Maybe we should remove the
EuclideanRing
instance, since it’s a lie? ThenInt64
would not have thediv
andmod
EuclideanRing
methods, and instead would have only the truncating division functionsquot
andrem
.https://pursuit.purescript.org/packages/purescript-prelude/6.0.1/docs/Data.EuclideanRing
https://pursuit.purescript.org/packages/purescript-integers/6.0.0/docs/Data.Int#v:quot
https://en.m.wikipedia.org/wiki/Modulo_operation
The text was updated successfully, but these errors were encountered: