Is there a convenient way to track the progress of this .
Albert.Rich has mentioned a version 5 of RUBI , that will use a
highly efficient , if ... then ... else structure . Is this the type of
structure that the new sympy , with matchpy , might generate .
If so , how might it perform , rela
On Saturday, 7 October 2017 12:30:16 UTC-4, Robert Dodier wrote:
>
> Hi Francesco, thanks for your response. The Rubi implementation looks very
> interesting, also the paper about matching algorithms. I will definitely
> take a close look at that.
>
Yes, the MatchPy authors have published a p
Hi Francesco, thanks for your response. The Rubi implementation looks very
interesting, also the paper about matching algorithms. I will definitely
take a close look at that.
What is your feeling about how the Rubi implementation turned out overall?
Did you run into any roadblocks on the way? D
Hi,
the code for RUBI is here:
https://github.com/sympy/sympy/tree/master/sympy/integrals/rubi
We have been using MatchPy:
https://github.com/HPAC/matchpy
MatchPy provides an associative-commutative pattern matcher. Unfortunately
it only supports Python 3.6.
We also have implementations for RU
Argh, I mean "for SymPy", of course.
On Wednesday, October 4, 2017 at 10:00:25 AM UTC-7, Robert Dodier wrote:
>
> Hi, I see there's been a lot of messages about Rubi for SymPy, but I
> haven't been able to figure out how it turned out. Can someone briefly
> summarize the status of the Rubi imple
