[plt-scheme] Fixed size integer arithmetic

Despite the wishful thinking of the R5RS committee there
are actual instances when computing with fixed size
integers, normally 32-bit, is useful.  Computing hash codes
is one pertinent example.  Does anyone have suggestions for
doing this in PLT Scheme?  My current ideas are:

  - implement fixed size arithmetic using the provided bit
manipulation operators
  - write the code in C

Neither seems very pleasant.  Any alternatives?

Cheers,
Noel

=====
Email: noelwelsh <at> yahoo <dot> com
Jabber: noelw <at> jabber <dot> org


		
__________________________________
Do you Yahoo!?
Yahoo! Mail - Helps protect you from nasty viruses.
http://promotions.yahoo.com/new_mail