1. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development, Coq’Art: The Calculus of Inductive Constructions. Springer, Texts in Theoretical Computer Science. An EATCS Series (2004)
2. Braun, G., Narboux, J.: From Tarski to Hilbert. In: Ida, T., Fleuriot, J. (eds.) Post-proceedings of Automated Deduction in Geometry 2012 volume 7993 of LNCS, pp. 89–109. Springer, Edinburgh (2012)
3. Boutry, P., Narboux, J., Schreck, P., Braun, G.: Automated Deduction in Geometry 2014. Proceedings of ADG 2014. In: Botana, Francisco, Quaresma, Pedro (eds.) Using small scale automation to improve both accessibility and readability of formal proofs in geometry. pp 1–19, Coimbra, Portugal (2014)
4. Chou, S.C., Gao, X.S.: Ritt-Wu’s Decomposition Algorithm and Geometry Theorem Proving. In: Stickel, Mark E. (eds.) CADE, volume 449 of Lecture Notes in Computer Science. pp 207–220, Springer (1990)
5. Delahaye, D., Mayero, M.: Field, une procédure de décision pour les nombres réels en coq. In: JFLA, pp. 33–48 (2001)