Waldek Hebisch <[email protected]> writes: > 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?) >> > > To make things clear: the GMP binding is effectively replacing > sbcl bignum routines by GMP routines and in principle can be > used by any sbcl program. Of course I will make this binding > available to sbcl developers and users. But due to licence > (LGPL vs public domain) and deployment issues there is only > small chance that it will be included in sbcl.
OK, then this makes a lot of sense to me. It makes me wonder though why nobody has done this before... > If you mean re-implementing GMP algorithms in sbcl, then this > makes some sense (in principle the algorithms may fit sbcl better) > but this is much larger task than creating binding, and the > effect while may be better than binging definitely will not > be much better -- again this fails the benefits/effort test. Yes, I agree entirely. Martin PS: many thanks for the patch to modhp you sent me. I'll polish algebraic dependency guessing as soon as possible! -- 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.
