@inproceedings{845ebb0156084532b77b0773f3868b89,
title = "Constructive reals in Coq : axioms and categoricity",
abstract = "We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamental Theorem of Algebra) project, carried out at Nijmegen University. The aim of this work is to show that these axioms can be satisffied, by constructing a model for them. Apart from that, we show the robustness of the set of axioms for constructive real numbers, by proving (in Coq) that any two models of it are isomorphic. Finally, we show that our axioms are equivalent to the set of axioms for constructive reals introduced by Bridges in [2]. The construction of the reals is done in the {\textquoteleft}classical way{\textquoteright}: first the rational numbers are built and they are shown to be a (constructive) ordered field and then the constructive real numbers are introduced as the usual Cauchy completion of the rational numbers.",
author = "J.H. Geuvers and M. Niqui",
year = "2002",
doi = "10.1007/3-540-45842-5_6",
language = "English",
isbn = "3-540-43287-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "79--95",
editor = "P. Callaghan and Z. Luo and J. McKinna and R. Pollack",
booktitle = "Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers)",
address = "Germany",
}