SuivantPrec.Bas prec.BasNiv. sup.

Bibliographie 

[ASU86]   A. Aho, R. Sethi and J. Ullman, Compilers (Principles, Techniques and Tools), Addison-Wesley, 1986.
[B86]   I. Bratko, Prolog (Programming for Artificial Intelligence), Addison-Wesley, 1986.
[BN98]   F. Baader and T. Nipkow, Term rewriting and all that, Cambridge University Press, 1998.
[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).
[F90]   R. Fateman, On the design and construction of algebraic manipulation systems, also published as: ACM Proceedings of the ISSAC-90, Tokyo, Japan.
[GG99]   J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, 1999.
[K98]   D. E. Knuth, The Art of Computer Programming (Volume 2, Seminumerical Algorithms), Addison-Wesley, 1998.
[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
[W96]   S. Wolfram, The Mathematica book, Wolfram Media, Champain, 1996.
[WH89]   P. Winston and B. Horn, LISP, Addison-Wesley, 1989.

SuivantPrec.Bas prec.HautNiv. sup.