18 search results - page 1 / 4 » Coinductive Formal Reasoning in Exact Real Arithmetic |
71
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
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...
CIE
2005
Springer
15 years 4 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
64
Voted
CSL
2009
Springer
15 years 5 months ago
2009
Springer
88
Voted
FLOPS
2008
Springer
15 years 3 days ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
MST
2007
14 years 10 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...