Am 02.09.2014 um 14:54 schrieb F. B.:
OK, by the way I see it an alternative structure for SymPy's pattern
matcher could be to define .match( ) in Basic only and cleverly use method
inheritance.
Actually that's normal use of inheritance :-)
> That is:
- express associativity through a static field (e.g. is_Associative)
- same if the type is an identity when given only one parameter (e.g.
is_one_param_identity)
- I would express commutativity as a method returning a generator of
permutations
Generator is a good approach, but it should take some parameter about
which permutations to generate first, to avoid combinatoric explosion.
Anyways, I would consider this task as low priority. Better first
concentrate on import the RUBI ruleset into SymPy.
If that means making a rule engine for SymPy that makes it easy to
transform RUBI rules for it, then I'm all for it.
Though the details discussed above seem to be part of how to best set up
a rule engine; isn't that spot on for RUBI, too?
--
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 http://groups.google.com/group/sympy.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/54060EFE.8060009%40durchholz.org.
For more options, visit https://groups.google.com/d/optout.
