Coinductive Field of Exact Real Numbers and General Corecursion

Milad Niqui
2006 Electronical Notes in Theoretical Computer Science  
In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given in two algorithms (homographic and quadratic algorithm) that operate on streams of Möbius maps. The algorithms can be seen as coalgebra maps on the coalgebra of streams and hence they will be formalised as general corecursive functions. We use the machinery of Coq proof assistant for coinductive types to present the formalisation.
doi:10.1016/j.entcs.2006.06.008 fatcat:rfyikrk5zvc3vhzh55gevj6v44