This is brilliant, IMHO.
On 12/6/06, William Stein <[EMAIL PROTECTED]> wrote: > > Sage calculus > f = alg expr > > f.subs(var, val, ...) > f.subs(dict) > f.subs(list of pairs) > implement recursively, with base case functions of 1 var and vars and > constants being clear. > > f.function(*args) - returns a callable version of f, which otherwise > works in same way. Output is result of subs. > this just another formal function, but with a call method. > Also, function((vars...),expr) makes an evaluatable function. > > f.derivative(var) - we completely implement. > > f.integral(var, optional endpoints) - feed expr to maxima (or maple or > mathematica or mathomatic or yaccas or??) and let it compute integral > symbolically. Sage_eval the result (if possible - if that fails, > maybe wrap the external object formally). > > Basic functions: all functions like sin, cos, exp, special funcs, > etc, will be defined as formal functions - a lot of this is already > done. > > > > --~--~---------~--~----~------------~-------~--~----~ 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/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
