Hi Angus, Thanks for your willingness to help. Although I'm not familiar with Mathics, can you briefly explain the algorithm used for pattern matching in Mathics.
Abdullah Javed Nesar On Saturday, March 11, 2017 at 8:41:27 PM UTC+5:30, Angus Griffith wrote: > > Hi Sympy people, > > I'd love to help out on this. The stuff I've written in Mathics I'm happy > to relicense under BSD for Sympy and I can certainly give guidance for > working with Mathics too. > > I've contributed to the pattern matcher but I'm not the original author of > most of that code so we'll need to get approval from Jan and a couple > others as well. > > The Mathics pattern matcher might be useful to study but I'm worried about > the performance on 10000 integration rules. Mathics will try each rule in > turn until it finds a match. > > The most useful parts of Mathics for this would be the parser and the > to/from Sympy converters. Both of these should be simple to relicense but > maybe that's not even needed and you can use Mathics as a compiler. > > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/4821e2a2-811a-4861-87b9-a61fb401ae6d%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
