When reasoning formally with polynomials over real numbers, or more generally real closed fields, we need to be able to manipulate easily statements featuring an order relation, either in their conditions or in their conclusion. For instance, we need to state the intermediate value theorem and the mean value theorem and we need tools to ease both their proof and their further use. For that purpose we propose a Coq library for ordered integral domains and ordered fields with decidable comparison. In this paper we present the design choices of this libraries, and show how it has been used as a basis for developing a fare amount of basic real algebraic geometry
Real analysis is pervasive to many applications, if only because it is a suitable tool for modeling ...
In the field of implicit computational complexity, we are con- sidering in this paper the fruitful b...
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is ...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
Un problème de géométrie algébrique réelle s'exprime sous forme d’un système d’équations et d’inéqua...
The Coq system is a proof assistant based on the Calculus of InductiveConstructions. In this work, w...
L'analyse réelle a de nombreuses applications car c'est un outil approprié pour modéliser de nombreu...
Proofs of the fundamental theorem of algebra can be divided upinto three groups according to the tec...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
International audienceThis article details a formalization in Coq of the Lindemann-Weierstrass theor...
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is ...
Real analysis is pervasive to many applications, if only because it is a suitable tool for modeling ...
In the field of implicit computational complexity, we are con- sidering in this paper the fruitful b...
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is ...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
Un problème de géométrie algébrique réelle s'exprime sous forme d’un système d’équations et d’inéqua...
The Coq system is a proof assistant based on the Calculus of InductiveConstructions. In this work, w...
L'analyse réelle a de nombreuses applications car c'est un outil approprié pour modéliser de nombreu...
Proofs of the fundamental theorem of algebra can be divided upinto three groups according to the tec...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
International audienceThis article details a formalization in Coq of the Lindemann-Weierstrass theor...
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is ...
Real analysis is pervasive to many applications, if only because it is a suitable tool for modeling ...
In the field of implicit computational complexity, we are con- sidering in this paper the fruitful b...
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is ...