Add to ORKGInternational audienceThis 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 archimedian 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 also intends to be a basis for the construction of complex algebraic numbers and to be a reference implementation for the certification of numerous algorithms relying on algebraic numbers in computer algebra
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This paper describes a formalization of discrete real closed fields in theCoq proof assistant. This ...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceThis paper shows a construction in Coq of the set of real algebraic numbers, t...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
International audienceThis paper describes a formalization of discrete real closed fields in the Coq...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This thesis presents a formalization of algebraic numbers and their theory. It brings two new import...
This paper describes a formalization of discrete real closed fields in theCoq proof assistant. This ...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...
When reasoning formally with polynomials over real numbers, or more generally real closed fields, we...