A coinductive approach to verified exact real number computation

Ulrich Berger, Sion Lloyd
2009 Electronic Communications of the EASST  
We present an approach to verified programs for exact real number computation that is based on inductive and coinductive definitions and program extraction from proofs. We informally discuss the theoretical background of this method and give examples of extracted programs implementing the translation between the representation by fast converging rational Cauchy sequences and the signed binary digit representations of real numbers.
doi:10.14279/tuj.eceasst.23.331 dblp:journals/eceasst/BergerL09 fatcat:yorfrgpl35gv5btt3bbcg4rfyy