S.D.Mechveliani wrote:
> I wonder, why Haskell does not check/report the overflow for Int?
After thinking about this for awhile, I agree with Sergey that there
should be an Int datatype that truly implements partial functions, not
total functions modulo some large N. For a compiler emitting nat
Recently I wrote
I wonder, why Haskell does not check/report the overflow for Int?
For the Haskell implementation, it is natural to have the Int
arithmetic cost much less (about 5 times) than Integer.
Therefore, for the applications like the polynomial arithmetics
(and many others) t
