An abstract data type for real numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 121-131

  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

AUTOMATA THEORY; BIOMINERALIZATION; CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS;

DATA TYPE; DENOTATIONAL SEMANTICS; DOMAIN THEORY; OPERATIONAL SEMANTICS; REAL NUMBER;

ABSTRACT DATA TYPES;

EID: 84951034016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. H.-J. Boehm and R. Cartwright. Exact real arithmetic: formulating real numbers as functions. In David Turner, editor, Research topics in functional programming, pages 43-64. Addison-Wesley, 1990.
2. H.-J. Boehm, R. Cartwright, M. Riggle, and M.J. O’Donell. Exact real arithmetic: a case study in higher order programming. In ACM Symposium on lisp and functional programming, 1986.
3. P. Di Gianantonio. A functional approach to real number computation. PhD thesis, University of Pisa, 1993.
4. P. Di Gianantonio. Real number computability and domain theory. Information and Computation, 127(1):11-25, May 1996.
5. A. Edalat and M. Escardo. Integration in real pcf. In IEEE Symposium on Logic in Computer Science, 1996.
6. M. Escardo. Pcf extended with real numbers. Theoret. Comput. Sei, July 1996.
7. D. Lacombe. Quelques precedes de definitions en topologie recursif. In Constructivity in mathematics, pages 129-158. North-Holland, 1959.
8. P. Martin-Löf. Note on Constructive Mathematics. Almqvist and Wiksell, Stockholm, 1970.
9. V. Ménissier-Morain. Arbitrary precission real arithmetic: design and algorithms. Submitted to the Journal of Symbolic Computation. Available at http://pauillac.inria.fr/menissier.
10. G.D. Plotkin. Lcf considered as a programing language. Theoret. Comput. Sei., 5:223-255, 1977.
11. Dana Scott. Outline of the mathematical theory of computation. In Proc. 4th Princeton Conference on Information Science, 1970.
12. T. Streicher. A universality theorem for pcf with recursive types, parallel-or and 3. Mathematical Structures for Computing Science, 4(1):111-115, 1994.
13. J. Vuillemin. Exact real computer arithmetic with continued fraction. In Proc. A. CM. conference on Lisp and functional Programming, pages 14-27, 1988.
14. K. Weihrauch. Computability. Springer-Verlag, Berlin, Heidelberg, 1987.