Re: [Haskell-cafe] abs minBound < (0 :: Int) && negate minBound == (minBound :: Int)

...

but Integer is actually (if you're using GMP with your ghc):

Yes, that's tolerably well known. You only pay the space overhead when you need it (like Lisp or Smalltalk). But you always pay the time overhead.

I thought Integers can't be unboxed, regardless of their magnitude?