I am not sure I will have time to be a mentor this year, but I would like to propose porting rubi to sage:
http://www.apmaths.uwo.ca/~arich/ It is a series of rules (over 6000) to be applied to symbolic expressions in order to get their primitive. The results they produce are better than the Mathematica builtin integrator, they succeed in a bigger number of cases, and they also hapen to be faster. If we could include that in Sage that would be a killer feature. Right now the rules are written in Mathematica language, and translating them by hand would be too much work for a person to do in a few months. So likely the best approach is to try and write a parser that could do it automatically. I have talked to one of the authors in person during a conference, and he really liked the idea of seeing it ported to a free system. In fact I thing that there have already been some discussion about this in maxima and sympy (maybe we could cooperate in this effort). -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
