, Logger killed when log rolls off truck at sawmill., 1995.

T. Joustra, Mentoring Takes Many Beneficial Forms, The Way Ahead, vol.02, issue.03, pp.12-13, 2006.

D. H. Bailey, J. M. Borwein, and A. D. Kaiser, Automated simplification of large symbolic expressions, Journal of Symbolic Computation, vol.60, pp.120-136, 2014.

-. Hans and . Boehm, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.562-576, 2020.

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.235-265, 1997.

A. Bostan, P. Flajolet, B. Salvy, and É. Schost, Fast computation of special resultants, Journal of Symbolic Computation, vol.41, issue.1, pp.1-29, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000960

J. Carette, Understanding expression simplification, Proceedings of the 2004 international symposium on Symbolic and algebraic computation - ISSAC '04, 2004.

J. Carette, Zero equivalence in computer algebra systems, Mathematics Stack Exchange, p.2020

T. Y. Chow, What Is a Closed-Form Number?, The American Mathematical Monthly, vol.106, issue.5, pp.440-448, 1999.

H. Cohen, A Course in Computational Algebraic Number Theory, 1996.

W. Decker, G. Greuel, G. Pfister, and H. Schönemann, Singular 4-1-2 -A computer algebra system for polynomial computations, 2019.

C. Fieker, W. Hart, T. Hofmann, and F. Johansson, Nemo/Hecke, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp.157-164, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01524140

S. Fischler and T. Rivoal, Linear independence of values of $G$-functions, Journal of the European Mathematical Society, vol.22, issue.5, pp.1531-1576, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01450032

W. B. Hart, Fast Library for Number Theory: An Introduction, Mathematical Software ? ICMS 2010, pp.88-91, 2010.

W. B. Hart, ANTIC: Algebraic number theory in C, Computeralgebra-Rundbrief, vol.56, 2015.

F. Johansson, Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic, IEEE Transactions on Computers, vol.66, issue.8, pp.1281-1292, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01394258

F. Johansson, FunGrim: A Symbolic Library for Special Functions, Lecture Notes in Computer Science, pp.315-323, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02506816

M. Kauers, Algorithms for Nonlinear Higher Order Difference Equations, 2005.

. Maxima and . Maxima,

A. Meurer, SymPy: symbolic computing in Python, PeerJ Computer Science, vol.3, p.103, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01404156

M. Monagan and R. Pearce, Rational simplification modulo a polynomial ideal, Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06, 2006.

J. Moses, Algebraic simplification, Communications of the ACM, vol.14, issue.8, pp.527-537, 1971.

N. Müller, The iRRAM: Exact Arithmetic in C++, Computability and Complexity in Analysis, pp.222-252, 2001.

D. Richardson, The elementary constant problem, Papers from the international symposium on Symbolic and algebraic computation - ISSAC '92, 1992.

D. Richardson, A simplified method of recognizing zero among elementary constants, Proceedings of the 1995 international symposium on Symbolic and algebraic computation - ISSAC '95, 1995.

D. Richardson, How to Recognize Zero, Journal of Symbolic Computation, vol.24, issue.6, pp.627-645, 1997.

D. Richardson, Zero Tests for Constants in Simple Scientific Computation, Mathematics in Computer Science, vol.1, issue.1, pp.21-37, 2007.

D. Richardson, Recognising zero among implicitly defined elementary numbers, 2009.

D. Richardson and J. Fitch, The identity problem for elementary functions and constants, Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994.

A. Steel, A New Scheme for Computing with Algebraically Closed Fields, Lecture Notes in Computer Science, pp.491-505, 2002.

A. Steel, Computing with algebraically closed fields, Journal of Symbolic Computation, vol.45, issue.3, pp.342-372, 2010.

P. The and . Group,

, Appendix: Answers to Exercises, The Sage Developers. SageMath, the Sage Mathematics Software System, vol.9, pp.401-446, 2018.

J. Van-der-hoeven, Computations with effective real numbers, Theoretical Computer Science, vol.351, issue.1, pp.52-60, 2006.

J. Van-der-hoeven, Computations with effective real numbers, Theoretical Computer Science, vol.351, issue.1, pp.52-60, 2006.

J. Van-der-hoeven, Effective real numbers in Mmxlib, Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06, 2006.

J. Yu, C. Yap, Z. Du, S. Pion, and H. Brönnimann, The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra, Mathematical Software ? ICMS 2010, pp.121-141, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00519591