I may have missed it, but I don't see a defined lower bound on the bit width of bitwise operations. This matters with operations that may set bits to 1 such as bitwise-not. For example it's unclear to me how many 1s are set in the result of (bitwise-not 0). The statement

"...every integer represents a semi-infinite bitstring, having either a finite number of zeros (negative integers) or a finite number of ones (non-negative integers)"

implies that (bitwise-not 0) has only a finite number of 1s, but the programmer may need to know how many.

Regards,

KW