I believe I just realised that
(* x y)
is *exactly* as fast in sbcl as
(* (the integer x) (the integer y))
i.e., there is no point at all declaring integers, except of course, if for
some reason sbcl can prove that x and y are in fact fixnums.
Is that correct?
I guess the same actually holds for
(+ (the integer x) 1)
doesn't it? (or is there a faster way to increment a bignum by one?)
In case the answers to the above are "yes", is that a principal impossibility,
or just because noone implemented something better (in sbcl)?