#### Filter Results:

#### Publication Year

2008

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Georges Gonthier, Andrea Asperti, Jeremy Avigad, Yves Bertot, Cyril Cohen, François Garillot +9 others
- ITP
- 2013

This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive , and relies on nothing but the axioms and rules of the founda-tional framework implemented by Coq. To support the formalization, we developed a… (More)

- Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mortberg
- 2016

This paper presents a type theory in which it is possible to directly manipulate n-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways to reason about identity types, for instance, function extensionality is directly provable in the system. Further,… (More)

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic properties. The theory of real algebraic numbers and more generally of semi-algebraic varieties is at the core of a number… (More)

- Cyril Cohen
- 2012

- Cyril Cohen
- ITP
- 2012

This paper shows a construction in Coq of the set of real algebraic numbers, together with a formal proof that this set has a structure of discrete Archimedean real closed field. This construction hence implements an interface of real closed field. Instances of such an interface immediately enjoy quantifier elimination thanks to a previous work. This work… (More)

We prove formally that the first order theory of algebraically closed fields enjoys quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We first reify the first order theory of rings and prove that quantifier elimination leads to decidability. Then we implement an algorithm which constructs a quantifier free formula… (More)

- Cyril Cohen
- ITP
- 2013

In intensional type theory, it is not always possible to form the quotient of a type by an equivalence relation. However, quotients are extremely useful when formalizing mathematics, especially in algebra. We provide a Coq library with a pragmatic approach in two complementary components. First, we provide a framework to work with quotient types in an… (More)

- Cyril Cohen
- 2010

R ´ ESUMÉ. La formalisation des structures quotients en théorie des types est unprobì eme délicat. On propose ici une nouvelle solution pratique pour manipuler ces structures dans le Calcul des Constructions Inductives. En particulier, on propose une méthode systématique pour les quotients constructifs basés sur des types munis d'uné egalité décidable. Dans… (More)