P. Aubry, Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Implantation en Axiom, 1999.

P. Aubry, D. Lazard, and M. M. Maza, On the Theories of Triangular Sets, Journal of Symbolic Computation, vol.28, issue.1-2, pp.105-124, 1999.
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870

F. Boulier, D. Lazard, F. Ollivier, and M. Petitot, Representation for the radical of a finitely generated differential ideal, Proceedings of the 1995 international symposium on Symbolic and algebraic computation , ISSAC '95, pp.158-166, 1995.
DOI : 10.1145/220346.220367
URL : https://hal.archives-ouvertes.fr/hal-00138020

F. Boulier, D. Lazard, F. Ollivier, and M. Petitot, Computing representations for radicals of finitely generated differential ideals, Applicable Algebra in Engineering, Communication and Computing, vol.3, issue.1, 1997.
DOI : 10.1007/s00200-009-0091-7
URL : https://hal.archives-ouvertes.fr/hal-00820902

D. Bouziane, A. Kandri-rody, and H. Maârouf, Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential Ideal, Journal of Symbolic Computation, vol.31, issue.6, pp.631-649, 2001.
DOI : 10.1006/jsco.1999.1562

J. Della-dora, C. Dicrescenzo, and D. Duval, About a new method for computing in algebraic number fields, Proceedings of EUROCAL85, pp.289-290, 1985.
DOI : 10.1007/3-540-15984-3_279

D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics, vol.150, 1995.

E. Hubert, Factorization-free Decomposition Algorithms in Differential Algebra, Journal of Symbolic Computation, vol.29, issue.4-5, pp.641-662, 2000.
DOI : 10.1006/jsco.1999.0344

M. Kalkbrener, A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties, Journal of Symbolic Computation, vol.15, issue.2, pp.143-167, 1993.
DOI : 10.1006/jsco.1993.1011

D. Erwin and K. , The art of computer programming, 1966.

D. Lazard, A new method for solving algebraic systems of positive dimension, Discrete Applied Mathematics, vol.33, issue.1-3, pp.147-160, 1991.
DOI : 10.1016/0166-218X(91)90113-B

M. Moreno and M. , On Triangular Decompositions of Algebraic Varieties, 2000.

M. Moreno, M. , and R. Rioboo, Polynomial gcd computations over towers of algebraic extensions, Proceedings of AAECC11, pp.365-382, 1995.

S. Morrison, Yet another proof of Lazard's lemma. private communication, december, 1995.

S. Morrison, The Differential Ideal [ P ] : M???, Journal of Symbolic Computation, vol.28, issue.4-5, pp.631-656, 1999.
DOI : 10.1006/jsco.1999.0318
URL : http://doi.org/10.1006/jsco.1999.0318

F. Ollivier, A proof of Lazard's lemma. private communication, october, 1998.

B. Sadik, Une note sur les algorithmes de d??composition en alg??bre diff??rentielle, Comptes Rendus de l'Académie des Sciences, pp.641-646, 2000.
DOI : 10.1016/S0764-4442(00)00221-4

J. Schicho and Z. Li, A construction of radical ideals in polynomial algebra, 1995.

C. Shang, X. Chou, and . Gao, On the dimension of an arbitrary ascending chain, Chinese Bulletin of Science, vol.38, pp.799-904, 1993.

D. Wang, Decomposing Polynomial Systems into Simple Systems, Journal of Symbolic Computation, vol.25, issue.3, pp.295-314, 1998.
DOI : 10.1006/jsco.1997.0177
URL : http://doi.org/10.1006/jsco.1997.0177

. Wu-wen-tsün, On the foundation of algebraic differential geometry, Mechanization of Mathematics, 1987.

L. Yang and J. Zhang, Searching dependency between algebraic equations: an algorithm applied to automated reasoning, Artificial Intelligence in Mathematics, pp.147-156, 1994.

O. Zariski and P. Samuel, Commutative Algebra François Boulier LIFL, Université Lille I, 59655 Villeneuve d'Ascq, France boulier@lifl.fr, http://www.lifl.fr/?boulier François Lemaire LIFL, 1958.