On 15 Sep, Hans Aberg wrote:
> The generalization of the Int type, as I see it, is a binary type, a
> sequence of bit of fixed length, which has special operations such as
> right/left shift with under/overflow, rotations, signed/unsigned arithmetic
> and Boolean bit operations.
agreed, though
I discovered and fixed a bug in my module Roots.html
(http://www.numeric-quest.com/haskell/)
Function "roots" was failing on certain sequencies, such
as [1,1,1,1,1,1] (but not [1,1,1,1,1,1,1], etc.) due to
division by zero in some circumstances.
