Yacas: A Do-It-Yourself Symbolic Algebra Environment
We describe the design and implementation of Yacas, a free computer algebra system currently under development. The system consists of a core interpreter and a library of scripts that implement symbolic algebra functionality. The interpreter provides a high-level weakly typed functional language designed for quick prototyping of computer algebra algorithms, but the language is suitable for all kinds of symbolic manipulation. It supports conditional term rewriting of symbolic expression trees, closures (pure functions) and delayed evaluation, dynamic creation of transformation rules, arbitrary-precision numerical calculations, and flexible user-defined syntax using infix notation. The library of scripts currently provides basic numerical and symbolic functionality. The main advantages of Yacas are: free (GPL) software; a flexible and easy-to-use programming language with a comfortable and adjustable syntax; cross-platform portability and small resource requirements; and extensibility.
Unable to display preview. Download preview PDF.
- [ASU86]A. Aho, R. Sethi and J. Ullman, Compilers (Principles, Techniques and Tools), Addison-Wesley, 1986.Google Scholar
- [B86]I. Bratko, Prolog (Programming for Artificial Intelligence), Addison-Wesley, 1986.Google Scholar
- [BN98]F. Baader and T. Nipkow, Term rewriting and all that, Cambridge University Press, 1998.Google Scholar
- [C86]G. Cooperman, A semantic matcher for computer algebra, in Proceedings of the symposium on symbolic and algebraic computation (1986), Waterloo, Ontario, Canada (ACM Press, NY).Google Scholar
- [F90]R. Fateman, On the design and construction of algebraic manipulation systems, also published as: ACM Proceedings of the ISSAC-90, Tokyo, Japan.Google Scholar
- [GG99]J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, 1999.Google Scholar
- [K98]D. E. Knuth, The Art of Computer Programming (Volume 2, Seminumerical Algorithms), Addison-Wesley, 1998.Google Scholar
- [KB70]D. E. Knuth and P. B. Bendix, Simple word problems in universal algebras, in Computational problems in abstract algebra, ed. J. Leech, p. 263, Pergamon Press, 1970.Google Scholar
- [TATA99]H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi, Tree Automata Techniques and Applications, 1999, online book: http://www.grappa.univ-lille3.fr/tata
- [WH89]P. Winston and B. Horn, LISP, Addison-Wesley, 1989.Google Scholar