--- Richard Fateman <fateman@cs.berkeley.edu> wrote:
> I'm not sure it will work in ANSI CL, but look in the
> file init.lisp
>
> #| ; to make all this in order..
> (mapc #'compile-file
> '("mma" "capsonlyparser" "stack1" "disp1" "eval" "poly" "rat1"
> "simp1" "pf" "match"
> "diffrat"))
> |#
>
> I tried loading it up and there is now some kind of name conflict
> for functions that exist in "mma" and also in lisp, but
> are different. And, or, not. If someone really wants to
> use this, I can look at it again. (I adapted pieces to
> other uses but have not maintained this.) There are notes
> on compiling it in KCL, the predecessor to GCL.
> RJF
Is mockmma actually a working computer algebra system, or is it more of
a framework in which to try out new techniques for stuff? Or, more to
the point, is there any way mockmma can be used to improve Maxima?
Earlier you mentioned you had a good start on Mathematica in Lisp,
which I'm assuming was mma, and I was wondering if there were abilities
there which would be worth including in Maxima. For example, I'm
intrigued by mma's ability to parse Mathematica syntax - would it be
possible to add that ability to Maxima, at least where a valid mapping
can be made?
__________________________________________________
Do You Yahoo!?
Find a job, post your resume.
http://careers.yahoo.com