Hello, I saw yacas mentioned here and there with sage http://www.mail-archive.com/[EMAIL PROTECTED]/msg04521.html http://www.sagemath.org:9001/Software
I think yacas would be useful to construct step-by-step solvers for teaching/exercising purpose http://www.google.lt/search?q=Student[Calculus1]+ShowSteps as it introduces itself as "a do-it-yourself symbolic algebra environment" http://yacas.sourceforge.net/essaysmanual.html The interpreter provides a high-level weakly typed functional language designed for quick prototyping of computer algebra algorithms, but the language is suitable for all kinds of symbolic manipulation. More details: It supports conditional term rewriting of symbolic expression trees, closures (pure functions) and delayed evaluation, dynamic creation of transformation rules, arbitrary-precision numerical calculations, and flexible user-defined syntax using infix notation. Their syntax is more pleasant than of LISP - as they say, lots of syntatic sugar :) does anyone else thnk it would be useful? ps.: other alternative may be to get expression tree representation prefix notation is a good start... http://www.math.utexas.edu/pipermail/maxima/2006/003538.html and parse it myself with python/sage (probably regex or so...) but yacas already has nice things in pattern description as y_IsFreeOf(x) -- Jurgis Pralgauskis mob.: 865-765-656, +37061677613; skype: dz0rdzas; Don't worry, be happy :) and make things better ;) --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~----------~----~----~----~------~----~------~--~---
