Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
Exact real arithmetic formulating real numbers as functions
Research topics in functional programming
Real number computability and domain theory
Information and Computation
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Exact real arithmetic: a case study in higher order programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Real numbers and computers
| Hi-index | 5.23 |
One possible approach to exact real arithmetic is to use linear fractional transformations (LFTs) to represent real numbers and computations on real numbers. Recursive expressions built from LFTs are only convergent (i.e., denote a well-defined real number) if the involved LFTs are sufficiently contractive. In this paper, we define a notion of contractivity for LFTs. It is used for convergence theorems and for the analysis and improvement of algorithms for elementary functions.