Admissible digit sets

Theoretical Computer Science

Volumn 351, Issue 1, 2006, Pages 61-73

  Hughes, Jesse ^a,b   Niqui, Milad ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Admissible representation; Exact real arithmetic; Stern Brocot representation

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS; PRODUCTIVITY; SET THEORY;

ADMISSIBLE REPRESENTATION; CORRECTNESS; EXACT REAL ARITHMETIC; STERN-BROCOT REPRESENTATION;

NUMBER THEORY;

EID: 31144464387     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.059     Document Type: Conference Paper

References (26)

1. B.P. Bates, Self-matching and interleaving in some integer sequences and the gauss map, Ph.D. Thesis, University of Wollongong, New South Wales, Australia, 2001.
2. Y. Bertot, Simple canonical representation of rational numbers, in: H. Geuvers, F. Kamareddine (Eds.), Proc. Workshop on Mathematics, Logic and Computation, Eindhoven, MLC'03, Electronic Notes on Theoretical Computer Science, Vol. 85.7, Elsevier Science Publishers, Amsterdam, 2003, < http://www1.elsevier.com/gej-ng/31/29/23/138/48/show/Products/notes/index. htt>.
3. H.-J. Boehm, R. Cartwright, M. Riggle, and M.J. O'Donnell Exact real arithmetic: a case study in higher order programming Proc. 1986 ACM Conf. on LISP and Functional Programming 1986 ACM Press New York 162 173
4. V. Brattka, and P. Hertling Topological properties of real number representations Theoret. Comput. Sci. 284 2 2002 241 257
5. The Coq Development Team, The Coq Proof Assistant Reference Manual, Version 8.0. INRIA, April 2004, .
6. E.W. Dijkstra, On the productivity of recursive definitions, Personal note EWD 749, , September 1980.
7. A. Edalat, P.J. Potts, A new representation for exact real numbers, in: S. Brookes, M. Mislove (Eds.), Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference (MFPS XIII), Carnegie Mellon Univ., Pittsburgh, PA, USA, March 23-26, 1997, Electronic Notes on Theoretical Computer Science, Vol. 6, Elsevier Science Publishers, Amsterdam, 1997, .
8. A. Edalat, P.J. Potts, P.Sünderhauf, Lazy computation with exact real numbers, in: M. Berman, S. Berman (Eds.), Proc. Third ACM SIGPLAN Internat. Conf. on Functional Programming (ICFP-98), Baltimore, MD, USA, September 27-29, 1998, ACM SIGPLAN Notices, Vol. 34(1), ACM Press, New York, January 1999, pp. 185-194.
9. R.W. Gosper, HAKMEM, Item 101 B, < http://www.inwap.com/pdp10/hbaker/hakmem/cf.html#item101b >, February 29 1972. MIT AI Laboratory Memo No.~239.
10. P. Gowland, D. Lester, A survey of exact arithmetic implementations, in: J. Blanck, V. Brattka, P. Hertling (Eds.), Computability and Complexity in Analysis: 4th Internat. Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, Lecture Notes in Computer Science, Vol. 2064, Springer, Berlin, 2001, pp. 30-47.
11. R.E. Graham, D.E. Knuth, and O. Patashnik Concrete Mathematics, A Foundation for Computer Science second ed. 1994 Addison-Wesley Reading, MA
12. R. Heckmann, How many argument digits are needed to produce n result digits? in: A. Edalat, D. Matula, P. Sünderhauf (Eds.), Real Number Computation (RealComp'98), Electronic Notes on Theoretical Computer Science, Vol. 24, Elsevier Science Publishers, Amsterdam, 1999. < http://www1.elsevier.com/gej-ng/31/29/23/48/23/show/Products/notes/index. htt>.
13. R. Heckmann Contractivity of linear fractional transformations Theoret. Comput. Sci. 279 1-2 2002 65 82
14. M. Konečný, Many-valued real functions computable by finite transducers using IFS-representations, Ph.D. Thesis, School of Computer Science, The University of Birmingham, UK, October 2000.
15. P. Liardet, and P. Stambul Algebraic computations with continued fractions J. Number Theory 73 1998 92 121
16. V. Ménissier-Morain, Arithmétique exacte, conception, algorithmique et performances d'une implémentation informatique en précision arbitraire. Thèse, Univ. Paris 7, France, December 1994.
17. A.M. Nielsen, P. Kornerup, MSB-first digit serial arithmetic, J. Universal Comput. Sci. 1(7) (1995) 527-547. .
18. M. Niqui, Formalising exact arithmetic: representations, algorithms and proofs, Ph.D. Thesis, Radboud University Nijmegen, The Netherlands, September 2004.
19. M. Niqui, Y. Bertot, QArith: Coq formalisation of lazy rational arithmetic, in: S. Berardi, M. Coppo, F. Damiani (Eds.), Types for Proofs and Programs: Internat. Workshop, TYPES 2003, Torino, Italy, April 30-May 4, 2003, Revised Selected Papers, Lecture Notes in Computer Science, Vol. 3085, Springer, Berlin, 2004, pp. 309-323.
20. P.J. Potts, Exact real arithmetic using Möbius transformations, Ph.D. Thesis, University of London, Imperial College, UK, July 1998, .
21. P.J. Potts, A. Edalat, Exact real computer arithmetic, Technical Report DOC 97/9, Department of Computing, Imperial College, March 1997, .
22. G.N. Raney On continued fractions and finite automata Math. Ann. 206 1973 265 283
23. B.A. Sijtsma On the productivity of recursive list definitions ACM Trans. Program. Lang. Systems (TOPLAS) 11 4 1989 633 649
24. J.E. Vuillemin Exact real computer arithmetic with continued fractions IEEE Trans. Comput. 39 8 1990 1087 1105
25. K. Weihrauch, Computable Analysis. An Introduction, Springer, Berlin, Heidelberg, 2000, 285pp.
26. E. Wiedmer Computing with infinite objects Theoret. Comput. Sci. 10 2 1980 133 155