Comparing functional paradigms for exact real-number computation

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

Volumn 2380 LNCS, Issue , 2002, Pages 488-500

  Bauer, Andrej ^a   Escardó, Martín Hötzel ^b   Simpson, Alex ^c  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CONTINUOUS FUNCTIONALS; DEFINABILITY; EQUILOGICAL SPACES; EXACT REAL NUMBER COMPUTATION; NATURAL NUMBER; SECOND ORDERS; TOTAL FUNCTIONALS; TYPE HIERARCHIES;

FUNCTIONAL PROGRAMMING;

EID: 33847701636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_42     Document Type: Conference Paper

References (24)

1. S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, volume 3, pages 1-168. OUP, 1994.
2. A. Bauer. The Realizability Approach to Computable Analysis and Topology. PhD thesis, Carnegie Mellon University, 2000.
3. A. Bauer, L. Birkedal, and D.S. Scott. Equilogical spaces. Theoretical Computer Science, to appear, 2002.
4. U. Berger. Total sets and objects in domain theory. Annals of Pure and Applied Logic, 60:91-117, 1993.
5. P. Di Gianantonio. A Functional Approach to Computability on Real Numbers. PhD thesis, Università di Pisa, 1993.
6. J. Dugundji. Topology. Wm. C. Brown, 1989.
7. M.H. Escardó and A. Edalat. Integration in real PCF. Information and Computation, 160:128-166, 2000.
8. M.H. Escardó, M. Hofmann, and Th. Streicher. Mediation is inherently parallel. Talk at Workshop on Domains V, Darmstadt, 1999.
9. M.H Escardó and Th. Streicher. Induction and recursion on the partial real line with applications to real PCF. Theoretical Computer Science, 210:121-157, 1999.
10. M.H. Escardó. PCF extended with real numbers. Theoretical Computer Science, 162:79-115, 1996.
11. P. Gowland and D. Lester. A survey of exact computer arithmetic. In Computability and Complexity in Analysis. Springer LNCS 2064, 2001.
12. http://www.haskell.org/.
13. S.C. Kleene. Countable functionals. In Constructivity in Mathematics, pages 81-100. North-Holland, 1959.
14. G. Kreisel. Interpretation of analysis by means of functionals of finite type. In Constructivity in Mathematics, pages 101-128. North-Holland, 1959.
15. S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.
16. M. Menni and A.K. Simpson. Topological and limit-space subcategories of countably-based equilogical spaces. Mathematical Structures in Computer Science, to appear, 2002.
17. D. Normann. Recursion on the countable functionals. Springer LNM 811, 1980.
18. D. Normann. Computabilty over the partial continuous functionals. Journal of Symbolic Logic, 65:1133-1142, 200
19. D. Normann. The continuous functionals of finite types over the reals. Electronic Notes in Theoretical Computer Science, 35, 2000.
20. D. Normann. Exact real number computations relative to hereditarily total functionals. Theoretical Computer Science, to appear, 2002.
21. G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5(3):223-255, 1977.
22. D.S. Scott. A new category? Unpublished Manuscript. Available at http://www.cs.cmu.edu/Groups/LTC/, 1996.
23. A.K. Simpson. Lazy functional algorithms for exact real functionals. In Mathematical Foundations of Computer Science, pages 456-464. Springer LNCS 1450, 1998.
24. K. Weihrauch and C. Kreitz. Representations of the real numbers and of the open subsets of the set of real numbers. Annals of Pure and Applied Logic, 35(3):247-260, 1987.