Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CORR
2008
Springer

favoriteEmaildiscussreport

154views Education» more CORR 2008»

Coinductive Formal Reasoning in Exact Real Arithmetic

13 years 4 months ago

Coinductive Formal Reasoning in Exact Real Arithmetic

Download homepages.cwi.nl

In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by coinductive streams. The algorithms work on coinductive stream of M

Milad Niqui

Real-time Traffic

Algorithms | Coinductive Stream | CORR 2008 | Education | Real Numbers |

claim paper

Related Content

» Formalising Exact Arithmetic in Type Theory

» From Coinductive Proofs to Exact Real Arithmetic

» Certified Exact Real Arithmetic Using Coinduction in Arbitrary Integer Base

» Productivity of EdalatPotts Exact Arithmetic in Constructive Type Theory

» Semantics of Exact Real Arithmetic

» Proofs Programs Processes

» Verifying Mixed RealInteger Quantifier Elimination

» A Tour with Constructive Real Numbers

» Verifying Imprecisely Working Arithmetic Circuits

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Milad Niqui

Comments (0)