karhu@cs.umu.se (Erik Lindstr|m) (05/08/91)
-- =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ Erik Lindstroem =+ This principle is so Dept. of Computing Science += perfectly general, that University of Umea =+ no particular application
karhu@ume.cs.umu.se (Erik Lindstr|m) (05/08/91)
(sorry for the empty massage) uUTRL v0.1 -- A small term rewriting laboratory featuring unification, completion, and rewriting modulo theorys (i.e. AC). uUTRL is written in SML of New Jersey (the current version is compiled with SML v0.66). The program is a collection of easy-to-replace well-defined(?) structure generators and should therefor be a good place for testing new algorithms, e.g. unification modulo different theories, solving linear diophantine equations, completion, matching, rewriting..... The system is easy to use. See some of the theory files for example of how to complete a theory involving AC-symbols. A short documentation is also provided. Questions, suggestions, bug-reports, other comments on the program or the implementations, etc. can be sent to term@cs.umu.se or to the address below. If you complete an intersting theory, please send us a copy of it for use in further development and evaluation of the system. The uUTRL system is primary a specification of a part of a parallel executing computer algebra system, called Nother. This system is implemented as part of a research project supported by the Swedish board of technology and questions about it can be sent to karhu@cs.umu.se How to get it: uUTRL is available through anonymous ftp from ftp.cs.umu.se in the compressed tar-file pub/uUTRL.tar.Z =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ Erik Lindstroem =+ This principle is so Dept. of Computing Science += perfectly general, that University of Umea =+ no particular application Sweden += of it is possible. karhu@cs.umu.se =+ -- G. Polya =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+