Eduardo Cavazos wrote:
For those of you who are interested in the design and implementation
of computer algebra systems, run, don't walk, to the library and grab
these:
http://web.cs.du.edu/~jscohen/ElementaryAlgorithms/index.htm
http://web.cs.du.edu/~jscohen/MathematicalMethods/index.htm
Eduardo Cavazos wrote:
Chapter 3 of the "Mathematical Methods" volume is dedicated to the topic
of "automatic simplification". This refers to the process by which a
computer algebra system transforms input expressions into a "canonical
form" which the more advanced algorithms expect and operate on.
A preliminary implementation of the ideas in this chapter is available
in a library '(mpl automatic-simplification)' at:
http://github.com/dharmatech/mpl/tree/master
This might come in handy for others. Maybe you're reading the book and
want to work on one of the specific algorithms which assume automatic
simplification. Or maybe you want to implement the process yourself and
want something to compare your work to.
Hello,
Here'a a few recent changes made to the 'mpl' libraries.
I added some more basic procedures based on those in the Cohen books;
substitute, sequential-substitute, and concurrent substitute.
Started adding some unit tests in (mpl test). Many of the tests are
drawn from examples and exercises from the Cohen books. The unit tests
pass in Ikarus, Ypsilon, and Mosh.
Installation instructions:
$ cd ~/scheme # Where ~/scheme is a path to your R6RS libraries
$ bzr branch lp:~ikarus-libraries-team/ikarus-libraries/srfi
$ git clone git://github.com/dharmatech/numero.git
$ git clone git://github.com/dharmatech/mpl.git
There's currently a dependency on the 'numero' libraries for the 'infix'
and 'alg' procedures.
To run the unit tests:
$ echo '(import (mpl test)) (test)' | ikarus
Ed
