Nicolas Magaud

Orcid: 0000-0002-9477-4394

According to our database1, Nicolas Magaud authored at least 23 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Matroid-Based Automatic Prover and Coq Proof Generator for Projective Incidence Geometry.
J. Autom. Reason., March, 2024

Towards Automatic Transformations of Coq Proof Scripts.
CoRR, 2024

2022
Some representations of real numbers using integer sequences.
Math. Struct. Comput. Sci., May, 2022

Pragmatic Isomorphism Proofs Between Coq Representations: Application to Lambda-Term Families.
Proceedings of the 28th International Conference on Types for Proofs and Programs, 2022

Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3, 2) Using the Coq Proof Assistant.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2021
Spreads and Packings of PG(3, 2), Formally!
Proceedings of the 13th International Conference on Automated Deduction in Geometry, 2021

Mechanization of Incidence Projective Geometry in Higher Dimensions, a Combinatorial Approach.
Proceedings of the 13th International Conference on Automated Deduction in Geometry, 2021

Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant.
Proceedings of the Proceedings Seventh Workshop on Proof eXchange for Theorem Proving, 2021

Two New Ways to Formally Prove Dandelin-Gallucci's Theorem.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Contributions au développement des méthodes formelles de preuves et applications à la géométrie.
, 2020

2019
Two cryptomorphic formalizations of projective incidence geometry.
Ann. Math. Artif. Intell., 2019

2018
Formalizing Some "Small" Finite Models of Projective Geometry in Coq.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2018

2015
Formalizing a discrete model of the continuum in Coq from a discrete geometry perspective.
Ann. Math. Artif. Intell., 2015

2012
A case study in formalizing projective geometry in Coq: Desargues theorem.
Comput. Geom., 2012

Designing and proving correct a convex hull algorithm with hypermaps in Coq.
Comput. Geom., 2012

Formal Proof in Coq and Derivation of an Imperative Program to Compute Convex Hulls.
Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

2009
Formalizing Desargues' theorem in Coq using ranks.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
Formalizing Projective Plane Geometry in Coq.
Proceedings of the Automated Deduction in Geometry - 7th International Workshop, 2008

2003
Changements de Représentation des Données dans le Calcul des Constructions. (Changing Data Representation in the Calculus of Constructions).
PhD thesis, 2003

Changing Data Representation within the Coq System.
Proceedings of the Theorem Proving in Higher Order Logics, 16th International Conference, 2003

2002
A Proof of GMP Square Root.
J. Autom. Reason., 2002

2001
Changement de représentation des structures de données en Coq: le cas des entiers naturels.
Proceedings of the Journées francophones des langages applicatifs (JFLA'01), 2001

2000
Changing Data Structures in Type Theory: A Study of Natural Numbers.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000


  Loading...