3 search results - page 1 / 1 » Productivity of Edalat-Potts Exact Arithmetic in Constructiv... |
MST
2007
13 years 7 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...
CIE
2005
Springer
14 years 1 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...
APAL
2008
13 years 7 months ago
2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...