 |
Conference papers
A Formalization of Grassmann-Cayley Algebra in COQ and Its Application to Theorem Proving in Projective Geometry
Abstract : This paper presents a formalization of Grassmann-Cayley algebra that has been done in the COQ proof assistant. The formalization is based on a data structure that represents elements of the algebra as complete binary trees. This allows to define the algebra products recursively. Using this formalization, published proofs of Pappus' and Desargues' theorem are interactively derived. A method that automatically proves projective geometric theorems is also translated successfully into the proposed formalization.
Cited literature [17 references]
https://hal.archives-ouvertes.fr/hal-00657901
Contributor : Laurent Fuchs <>
Submitted on : Monday, January 9, 2012 - 2:34:35 PM
Last modification on : Wednesday, January 8, 2020 - 11:04:18 AM
Document(s) archivé(s) le : Monday, November 19, 2012 - 1:00:56 PM
Contributor : Laurent Fuchs <>
Submitted on : Monday, January 9, 2012 - 2:34:35 PM
Last modification on : Wednesday, January 8, 2020 - 11:04:18 AM
Document(s) archivé(s) le : Monday, November 19, 2012 - 1:00:56 PM
File
fuchs_thery_adg10_postproc_fin...
Files produced by the author(s)
