+{- $notes
+
+* All arithmetic is performed modulo 2^n, where @n@ is the number of
+ bits in the type.
+
+* For coercing between any two integer types, use 'Prelude.fromIntegral',
+ which is specialized for all the common cases so should be fast
+ enough. Coercing word types (see "Data.Word") to and from integer
+ types preserves representation, not sign.
+
+* The rules that hold for 'Prelude.Enum' instances over a
+ bounded type such as 'Int' (see the section of the
+ Haskell report dealing with arithmetic sequences) also hold for the
+ 'Prelude.Enum' instances over the various
+ 'Int' types defined here.