home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   sci.math.symbolic      Symbolic algebra discussion      10,432 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 10,114 of 10,432   
   Richard Fateman to All   
   Re: Julia is the future of RUBI !   
   05 Mar 21 16:10:46   
   
   From: fateman@gmail.com   
      
   Since pattern matching in Mathematica can be used to invoke any computation   
   possible in Mathematica, there is a superficial implausibility that all of   
   Rubi can be moved without implementing a substantial chunk of Ma   
   hematica-simulation code -- say    
   simplification of various sorts.   
      
   Now if Albert and friends have arranged for Rubi's matching and replacement to   
   be simply tree-traversals  (checking the main operator, etc.) and tree   
   substitutions, that would be really great.   
   I think we are not there yet, and as Rubi grows, that goal may be retreating   
   to the back burner.   
      
   A few years ago I downloaded a bunch of Rubi files, ran them through my   
   Mathematica parser (written in Common Lisp) and ran a bunch of tests   
   successfully through my mma mathematica-like evaluator.   
       
   There were glitches, and I set the project aside waiting for the version of   
   Rubi that was promised to use just if-then-else.  Still in the future,   
   apparently.  My code is freely available.   
      
     I'd be happy to see Rubi in python, julia, c, Reduce, Axiom.... etc.    
      
    Just mentioning that there is already   
   at least one lisp system that can parse Mathematica, understanding the pattern   
   syntax,   
   and do rudimentary symbolic arithmetic  (it could do more by using Maxima,   
   just sitting by the side   
   in this setup).  So hearing Rubi can be done in X [not Lisp] means to me   
      
   (a) Someone else  (Albert? or X-fan) has translated the source code to a form    
   Y that can be loaded into an X system   
   (b) Someone has implemented a program that can read a test problem P and run   
   it through the matching program comparing it to patterns in Y, and find   
   /display  a match if one is found.   
      
   If the Rubi code includes calls to, say, SuperFullSimplify[..], then there is   
   some extra work needed by the X-fans.  I wasn't keen on that, mimicking exact   
   results. Just saying.   
      
   RJF   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca