M. Barnabei, A. Brini, and G. C. Rota, On the exterior calculus of invariant theory, Journal of Algebra, vol.96, issue.1, pp.120-160, 1985.
DOI : 10.1016/0021-8693(85)90043-2

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, Coq'Art: The Calculus of Inductive Constructions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

H. Crapo and J. Richter-gebert, Automatic Proving of Geometric Theorems, White [16], pp.167-196
DOI : 10.1007/978-94-015-8402-9_8

L. Dorst, D. Fontijne, and S. Mann, Geometric algebra for computer science, ACM SIGACT News, vol.39, issue.4, 2007.
DOI : 10.1145/1466390.1466396

P. Doubilet, G. C. Rota, and J. Stein, On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory, Studies in Applied Mathematics, vol.28, issue.3, pp.185-216, 1974.
DOI : 10.1002/sapm1974533185

M. Hawrylycz, A geometric identity for Pappus' theorem., Proceedings of the National Academy of Sciences, vol.91, issue.8, p.2909, 1994.
DOI : 10.1073/pnas.91.8.2909

D. Hestenes and G. Sobczyk, Clifford Algebra to Geometric Calculus: A Unified Language for Mathematics and Physics, Fundamental Theories of Physics, 1984.
DOI : 10.1007/978-94-009-6292-7

P. Janicic, J. Narboux, and P. Quaresma, The Area Method : a Recapitulation, Journal of Automated Reasoning, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00426563

H. Li, Algebraic Representation, Elimination and Expansion in Automated Geometric Theorem Proving, ADG'02. LNAI, pp.106-123, 2002.
DOI : 10.1007/978-3-540-24616-9_7

H. Li and Y. Wu, Automated short proof generation for projective geometric theorems with Cayley and bracket algebras, Journal of Symbolic Computation, vol.36, issue.5, pp.717-762, 2003.
DOI : 10.1016/S0747-7171(03)00067-1

N. Magaud, J. Narboux, and P. Schreck, Formalizing Projective Plane Geometry in Coq, Proceedings of ADG'2008, pp.1-20, 2008.
DOI : 10.1007/978-3-642-21046-4_7

URL : https://hal.archives-ouvertes.fr/inria-00305998

N. Magaud, J. Narboux, and P. Schreck, Formalizing Desargues' theorem in Coq using ranks, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, 2009.
DOI : 10.1145/1529282.1529527

URL : https://hal.archives-ouvertes.fr/inria-00335719

D. Michelucci and P. Schreck, INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH, International Journal of Computational Geometry & Applications, vol.16, issue.05n06, pp.5-6, 2006.
DOI : 10.1142/S0218195906002130

B. Sturmfels, Algorithms in Invariant Theory, 1993.
DOI : 10.1007/978-3-7091-4368-1

N. L. White, Invariants Methods in Discrete and Computational Geometry, Kluwer, 1995.
DOI : 10.1007/978-94-015-8402-9

N. L. White, A Tutorial on Grassmann-Cayley Algebra, Invariants Methods in Discrete and Computational Geometry [16], pp.93-106
DOI : 10.1007/978-94-015-8402-9_5

N. L. White, Geometric applications of the grassmann-cayley algebra, pp.881-892, 1997.
DOI : 10.1201/9781420035315.ch59