next up previous contents
Next: About this document ... Up: A Calculator for Exact Previous: Expression Language

References

1
A. Avizienis.
Signed-digit number representations for fast parallel arithmetic.
IRE Transactions on Electronic Computers, 10:389-400, 1961.

2
David H. Bailey, Jonathon M. Borwein, Peter B. Borwein, and Simon Plouffe.
The quest for pi.
http://www.cecm.sfu.ca/ pborwein/PAPERS/P130.ps, June 1996.

3
H. J. Boehm, R. Cartwright, M. J. O'Donnel, and M. Riggle.
Exact real arithmetic, a case study in higher order programming.
In Proceedings of the ACM conference on Lisp and functional programming, pages 162-173, August 1986.

4
Hans Boehm and Robert Cartwright.
Exact real arithmetic, formulating real numbers as functions.
In David A. Turner, editor, Research Topics in Functional Programming, chapter 3, pages 43-64. Addison-Wesley, 1990.

5
Hans-Juergen Boehm.
Constructive real interpretation of numerical programs.
In Proceedings of the SIGPLAN '87 Symposium on Interpreters and Interpretive Techniques, pages 214-221. ACM Press, June 1987.

6
L. E. J. Brouwer.
Besitzt jede reelle Zahl eine Dezimalbruchentwicklung.
Math Ann, pages 210-210, 1920.

7
R. L. Devaney.
An Introduction to Chaotic Dynamical Systems.
Addison-Wesley, California, 2nd edition, 1989.

8
Pietro di Gianantonio.
A functional approach to computability on real numbers.
PhD thesis, University of Pisa, 1993.
Technical Report TD 6/93.

9
Pietro di Gianantonio.
A golden ratio notation for the real numbers.
Technical report, CWI, 1997.

10
Abbas Edalat and Peter John Potts.
A new representation for exact real numbers.
Electronic Notes in Theoretical Computer Science, 6, 1997.
http://www.elsevier.nl/locate/entcs/volume6.html.

11
Martín Escardó.
PCF extended with real numbers.
Theoretical Computer Science, 162:79-115, 1996.

12
Martín Escardó.
Effective and sequential definition by cases on the reals via infinite signed-digit numerals.
Unpublished Note, April 1998.

13
R. W. Gosper.
Item 101b: Continued fraction arithmetic.
HAKMEM, MIT Artificial Intelligence Memo 239, pages 39-44, February 1972.

14
Reinhold Heckmann.
The appearance of big integers in exact real arithmetic based on linear fractional transformations.
In Proc. Foundations of Software Science and Computation Structures, Lisbon, 1998.

15
Reinhold Heckmann.
Contractivity of linear fractional transformations.
In Chesneaux et al, editor, Proceedings of the Third Real Numbers and Computers Conference, pages 45-59, Université Pierre et Marie Curie, Paris, France, April 1998.

16
John Hughes.
Why functional programming matters.
Computer Journal, 32(1), 1989.

17
Donald E. Knuth.
The Art of Computer Programming, Seminumerical algorithms, volume 2.
Addison-Wesley, 2nd edition, 1981.

18
Ker-I Ko.
Complexity Theory of Real Functions.
Birkhauser, Boston, 1991.

19
Peter Kornerup and David Matula.
An algorithm for redundant binary bit-pipelined rational arithmetic.
IEEE Transactions on Computers, 39(8):1106-1115, August 1990.

20
Valérie Ménissier-Morain.
Arbitrary precision real arithmetic: design and algorithms.
Journal of Symbolic Computation, 1996.

21
Asger Munk Nielsen and Peter Kornerup.
MSB-first digit serial arithmetic.
Journal of Universal Computer Science, 1(7):527-547, 1995.

22
Peterson, Hammond, Augustsson, Boutel, Fasel, Gordon, Hughes, Hudak, Johnsson, Jones, Meijer, Peyton-Jones, Reid, and Wadler.
Report on the programming language Haskell - a non-strict purely functional language - version 1.4.
http://haskell.org/, April 1997.

23
P. J. Potts, A. Edalat, and M. H. Escardó.
Semantics of exact computer arithmetic.
In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 248-257, Warsaw, Poland, 1997. IEEE Computer Society Press.

24
Peter John Potts and Abbas Edalat.
Exact real computer arithmetic.
Imperial College, March 1997.

25
Patrick M. Sansom and Simon L. Peyton Jones.
Time and space profiling for non-strict higher-order functional languages.
Research Report FP-1994-10, 1994.
Dept. of Computing Science, University of Glasgow.

26
Alex K. Simpson.
Lazy functional algorithms for exact real functionals (extended abstract).
Submitted, 1998.

27
Philipp Sünderhauf.
Incremental addition in exact real arithmetic.
Technical report, The Department of Computing, Imperial College, London, December 1997.

28
Alan Turing.
A correction.
The London Mathematical Society, 43:544-546, 1937.

29
Alan Turing.
On computable numbers, with an application to the Entscheindungproblem.
The London Mathematical Society, 42:230-265, 1937.

30
J. V. Uspensky.
Theory of Equations.
McGraw-Hill, New York, 1948.

31
Jean E. Vuillemin.
Exact real computer arithmetic with continued fractions.
IEEE Transactions on Computers, 39(8):1087-1105, August 1990.

32
Philip Wadler.
Comprehending monads.
Mathematical Structures in Computer Science, 2:461-493, 1992.

33
E. Wiedmer.
Computing with infinite objects.
Theoretical Computer Science, 10:133-155, 1980.



Martin Escardo
5/11/2000