Certified Exact Transcendental Real Number Computation in Coq

  • Russell O’Connor
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5170)


Reasoning about real number expressions in a proof assistant is challenging. Several problems in theorem proving can be solved by using exact real number computation. I have implemented a library for reasoning and computing with complete metric spaces in the Coq proof assistant and used this library to build a constructive real number implementation including elementary real number functions and proofs of correctness. Using this library, I have created a tactic that automatically proves strict inequalities over closed elementary real number expressions by computation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Russell O’Connor
    • 1
  1. 1.Institute for Computing and Information Science Faculty of ScienceRadboud University NijmegenNetherlands

Personalised recommendations