On Tue, 3 Aug 2010, Martin Rubey wrote:
Waldek Hebisch <[email protected]> writes:
- binding to GMP (= much faster bignum multiplication with sbcl)
if gmp is faster than sbcl bignums, why isn't it possible to improve
sbcl instead? (i.e., what am I missing?)
GMP used to be under GPL, sbcl is public domain with some BSD-licensed
parts, clearly incompatible. GMP has been re-licensed under LGPL-3. I
don't know if they are now compatible; probably, no.
Andrey
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
