[Yhc] pure-Haskell Integer implementation

Neil Mitchell ndmitchell at gmail.com
Thu Jul 26 12:19:04 EDT 2007


Hi Isaac,

> (maybe a strictness issue, haven't looked into it) ...although, all
> functions are fast for small values that fit in one Int.  Is anyone
> interested in more details or work on this?

I am interested in the code! Yhc has the option to not build Integer's
into the compiler, which saves space, and eases libgmp porting issues.
This seems like the perfect middle ground. Perhaps you could release
it as a library to Hackage? Perhaps call it BigInt rather than
Integer, then Yhc in "no libgmp" mode can silently rename Integer ->
BigInt without it having to go into base.

> (P.S. I wonder if I should ask any other mailing list than yhc's?)

Perhaps libraries@ ?

I can envisage #ifdef NATIVE_INTEGER then primitives, else use your
Integer library.

Thanks

Neil


More information about the Yhc mailing list