Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

We present C-CoRN, the Constructive Coq Repository at Nijmegen. It consists of a
mathematical library of constructive algebra and analysis formalized in the theorem prover …

Nous nous intéressons ici à la génération de programmes certifiés corrects par construction.
Ces programmes sont obtenus en extrayant l'information pertinente de preuves …

We implement extraction of Coq programs to functional languages based on MetaCoq's
certified erasure. As part of this, we implement an optimisation pass removing unused …

Floating point operations are fast, but require continuous effort on the part of the user in
order to ensure that the results are correct. This burden can be shifted away from the user by …

Abstract Reasoning about real number expressions in a proof assistant is challenging.
Several problems in theorem proving can be solved by using exact real number …

We implement extraction of Coq programs to functional languages based on MetaCoq's
certified erasure. We extend the MetaCoq erasure output language with ty** information …

In this paper we will discuss various aspects of computable/constructive analysis, namely
semantics, proofs and computations. We will present some of the problems and solutions of …

This thesis is concerned with the formalization of mathematics in the proof assistant Coq, in
particular the formalization of Bishop's constructive development of Real Analysis. In order to …

Using computation inside proofs is a powerful technique. The proof of the four colour
theorem [Apple and Haken, 1976] and Kepler's conjecture [Hales, 2002] both make heavy …