An abstract data type for real numbers

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 295-326

  Di Gianantonio, Pietro ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Abstract data types; Denotational and operational semantics; Domain theory; Real number computability

Indexed keywords

EID: 0009898875     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00036-5     Document Type: Article

References (28)

1. O. Aberth, Computable Analysis, McGraw-Hill, New York, 1980.
2. G. Berry, Stable models of the typed lambda-calculi, in Proc. 5th Internat. Coll. on Automata Languages and Programming, Lecture Notes in Computer Science, vol. 62, Springer, Berlin, 1978.
3. E. Bishop, Foundation of Constructive Analysis, McGraw-Hill, New York, 1967.
4. H.-J. Boehm, R. Cartwright Exact real arithmetic: formulating real numbers as functions, in: D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1990, pp. 43-64.
5. H.-J. Boehm, R. Cartwright, M. Riggle, M.J. O'Donell, Exact real arithmetic: a case study in higher order programming, ACM Symp. on Lisp and Functional Programming, 1986.
6. G.S. Ceitin, Algorithmic operators in constructive metric spaces, Trudy Mat. Inst. Steklov (English translation, Amer. Math. Soc. Transl.) 64(2) (1967) 1-80.
7. G.S. Ceitin, Algorithmic operators in constructive metric spaces, Trudy Mat. Inst. Steklov (English translation, Amer. Math. Soc. Transl.) 64(2) (1967) 1-80.
8. S. Cook, Computability and complexity of higher type functions, MSRI Proc., 1990.
9. P. Di Gianantonio, A functional approach to real number computation, Ph.D. Thesis, University of Pisa, 1993.
10. P. Di Gianantonio, Real number computability and domain theory, Inform. Comput. 127(1) (1996) 11-25.
11. A. Edalat, M. Escardo, Integration in real PCF, IEEE Symp. on Logic in Computer Science, 1996, pp. 382-393.
12. A. Edalat, P.J. Potts, A new representation for the exact real numbers, MFPS 97, ENTCS., vol. 6, Elsevier Science, Amsterdam, 1997.
13. M. Escardo, PCF extended with real numbers, Theoret. Comput. Sci. (1996) 79-115.
14. A. Grzegorczyk, On the definition of computable real continuous functions, Fund. Math. 44 (1957) 61-77.
15. D. Lacombe, Quelques procédés de définitions en topologie recursif, in: Constructivity in Mathematics, North-Holland, Amsterdam, 1959, pp. 129-158.
16. P. Martin-Löf, Note on Constructive Mathematics, Almqvist and Wiksell, Stockholm, 1970.
17. Ménissier-Morain, Arithmétique exacte, conception, algorithmique et performances d'une implémentation informatique en prcision arbitraire, Thèse, Université Paris 7, December 1994.
18. V. Ménissier-Morain, Arbitrary precission real arithmetic: design and algorithms, J. Symbolic Comput., Submitted. Available at http://pauillac.inria.fr/menissier.
19. G.D. Plotkin, LCF considered as a programing language, Theoret. Comput. Sci. 5 (1977) 223-255.
20. P.J. Potts, A. Edalat, M.H. Escardo, Semantcis of exat real arithmetic, IEEE Symp. on Logic in Computer Science, 1997.
21. H.G. Rice, Recursive real numbers, Proc. Amer. Math. Soc. 5 (1954) 784-791.
22. D. Scott, Outline of the mathematical theory of computation, Proc. 4th Princeton Conf. on Information Science, 1970.
23. A. Simpson, Lazy functional algorithms for exact real functionals, MFCS 1998, Lecture Notes in Computer Science, Springer, Berlin, 1998.
24. T. Streicher, A universality theorem for pcf with recursive types, parallel-or and ∃, Math. Struct. Comput. Sci. 4(1) (1994) 111-115.
25. A.S. Troelstra, D. van Dalen, Constructivism in Mathematics, North-Holland, Amsterdam, 1988.
26. A.M. Turing, On computable numbers, with an application to the entscheidungs problem, Proc. London Math. Soc. 42 (1937) 230-265.
27. J. Vuillemin, Exact real computer arithmetic with continued fraction, Proc. ACM Conf. on Lisp and functional Programming, 1988, pp. 14-27.
28. K. Weihrauch, Computability, Springer, Berlin, 1987.