Integration in real PCF

Information and Computation

Volumn 160, Issue 1-2, 2000, Pages 128-166

  Edalat, Abbas ^a   Escardó, Martín Hötzel ^a,b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGRATION; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

REAL NUMBERS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034632151     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2844     Document Type: Article

References (51)

1. Abramsky, S., and Jung, A. (1999), Domain theory, in "Handbook of Logic in Computer Science" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 3, pp. 1-168, Clarendon Press, Oxford.
2. Alvarez-Manilla, M. (1996), "A Generalization of the Riemann-Stieltjes Integral Using Domain Theory," Master's thesis, Department of Computing, Imperial College.
3. Barendregt, H. P. (1981), "The Lambda-Calculus: its Syntax and Semantics," North-Holland, Amsterdam.
4. Barendregt, H. P. (1992), Lambda calculi with types, in "Handbook of Logic in Computer Science" (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 2, pp. 117-309, Clarendon Press, Oxford.
5. Bishop, E., and Bridges, D. (1985), "Constructive Analysis," Springer-Verlag, Berlin.
6. Blum, L., Shub, M., ans Smale, S. (1989), On a theory of computation and complexity over the real numbers, Bull. Amer. Math. Soc. 21, 1-46.
7. Boehm, H. J., and Cartwright, R. (1990), Exact real arithmetic: Formulating real numbers as functions, in "Research Topics in Functional Programming" (D. Turner, Ed.), pp. 43-64, Addison-Wesley, Reading, MA.
8. Boehm, H. J., Cartwright, R., Riggle, M., and O'Donnel, M. J. (1986), Exact real arithmetic: A case study in higher order programming, in "ACM Symposiuum on Lisp and Functional Programming."
9. Bourbaki, N. (1966), "General Topology," Vol. 1, Addison-Wesley, London.
10. Edalat, A. (1995a), Domain of computation of a random field in statistical physics, in "Theory and Formal Methods 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Møller Centre, Cambridge, 11-14 September, 1995" (C. Hankin, I. Mackie, and R. Nagarajan, Ed.), IC Press, Cambridge, UK.
11. Edalat, A. (1995b), Domain theory and integration, Theoret. Comput. Sci. 151, 163-193.
12. Edalat, A. (1995c), Domain theory in learning processes, "Proceedings of MFPS" (S. Brookes, M. Main, A. Melton, and M. Mislove, Eds.), Electronic Notes in Theoretical Computer Science, Vol. 1, Elsevier, Amsterdam.
13. Edalat, A. (1995d), Domain theory in stochastic processes, in "Proceedings of Logic in Computer Science (LICS), Tenth Annual IEEE Symposium, 26-19 June, 1995, San Diego," IEEE Computer Society Press, Los Alamitos, CA.
14. Edalat, A. (1995e), Dynamical systems, measures and fractals via domain theory, Inform. and Comput. 120, 32-48.
15. Edalat, A. (1996), Power domains and iterated function systems, Inform. and Comput. 124, 182-197.
16. Edalat, A. (1997), When Scott is weak on the top, Math. Structures Comput. Sci. 7, 401-417.
17. Edalat, A., and Heckmann, R. (1998), A computational model for metric spaces, Theoret. Comput. Sci. 193, 53-73.
18. Edalat, A., and Negri, S. (1996), Generalised Riemann integral on locally compact spaces, in "Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop, Christ Church, Oxford, April 1996" (A. Edalat, S. Jourdan, and G. McCusker, Eds.), pp. 73-84, IC Press, Cambridge, UK.
19. Full paper to appear in Topology Appl.
20. Edalat, A., Potts, P. J., and Sünderhauf, P. (1998), Lazy computation with exact real numbers, in "Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming," pp. 185-194.
21. Escardó, M. H. (1995), Induction and recursion on the real line, in "Theory and Formal Methods 1994: Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, Møller Centre, Cambridge, 11-14 September" (C. Hankin, I. Mackie, and R. Nagarajan, Eds.), pp. 259-282, IC Press, Cambridge, UK.
22. Escardó, M. H. (1996a), PCF extended with real numbers, Theoret. Comput. Sci. 162, 79-115.
23. Escardó, M. H. (1996b), Real PCF extended with 3 is universal, in "Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop, Christ Church, Oxford, April 1996" (A. Edalat, S. Jourdan, and G. McCusker, Eds.), pp. 13-24, IC Press, Cambridge, UK.
24. Escardó, M. H. (1997), "PCF Extended with Real Numbers: A Domain-Theoretic Approach to Higher-Order Exact Real Number Computation," Technical report ECS-LFCS-97-374, Department of Computer Science, University of Edinburgh. [Ph.D. thesis, Imperial College of the University of London, 1997]
25. Escardó, M. H. (1998), Properly injective spaces and function spaces, Topology Appl. 89, 75-120.
26. Escardó, M. H., and Claudio, D. M. (1993), "Scott Domain Theory as a Foundation for Interval Analysis," Technical Report 218, UFRGS/II, Porto Alegre, Brazil.
27. Escardó, M. H., and Streicher, T. (1999), Induction and recursion on the partial real line with applications to Real PCF, Theoret. Comput. Sci. 210, 121-157.
28. Di Gianantonio, P. (1993a), "A Functional Approach to Computability on Real Numbers," Ph.D. thesis, University of Pisa. [Technical Report TD 6/93]
29. Di Gianantonio, P. (1993b), Real number computability and domain theory, in "18th Symposium on Mathematical Foundation of Computer Science," Lecture Notes in Computer Science, Vol. 711, pp. 413-422, Springer-Verlag, Berlin.
30. Di Gianantonio, P. (1996), Real number computability and domain theory, Inform. and Comput. 127, 11-25.
31. Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M., and Scott, D. S. (1980), "A Compendium of Continuous Lattice," Springer-Verlag, Berlin/New York.
32. Gunter, C. A. (1992), "Semantics of Programming Languages - Structures and Techniques," The MIT Press, London.
33. Hocking, J. G., and Young, G. S. (1988), "Topology," Dover, New York.
34. Ko, Ker-I. (1991), "Complexity Theory of Real Functions," Birkhäuser, Boston.
35. Martin-Löf, P. (1970), "Notes on Constructive Mathematics," Almqvist & Wiksel, Stockholm.
36. Moore, R. E. (1966), "Interval Analysis," Prentice-Hall, Englewood Cliffs, NJ.
37. Plotkin, G. (1977), LCF considered as a programming language, Theoret. Comput. Sci. 5, 223-255.
38. Potts, P. J. (1995), "The Storage Capacity of Forgetful Neural Networks," Master's thesis, Department of Computing, Imperial College.
39. Potts, P. J. (1997), "Efficient On-line Computation of Real Functions Using Exact Floating Point," Technical report, Imperial College, Department of Computing, http://theory.doc.ic.ac.uk/∼pjp.
40. Potts, P. J., Edalat, A., and Escardó, M. H. (Jun. 1997), Semantics of exact real arithmetic, in "Proceedings of the Twelveth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland," pp. 248-257.
41. Pour-el, M. B., and Richards, I. (1983), Computability and non-computability in classical analysis, Trans. Am. Math. Soc., pp. 539-560.
42. Royden, H. L. (1988), "Real Analysis," third ed., Collier Macmillan, London.
43. Schalk, A. (1993), "Algebras for Generalized Power Constructions," Ph.D. thesis, Technische Hochschule Darmstadt, ftp//ftp.cl.cam.ac.uk/papers/as213/diss.dvi.gz.
44. Scott, D. S. (1972), Continuous lattices, in "Toposes, Algebraic Geometry and Logic," (F. W. Lawvere, Ed.), Lectures Notes in Mathematics, Vol. 274, pp. 97-136, Springer-Verlag, Berlin.
45. Simpson, A. (1998), Functional algorithms for exact real functionals, in "Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 1450, pp. 456-464, Springer-Verlag, Berlin.
46. Smyth, M. B. (1983), Power domains and predicate transformers: a topological view, in "Automata, Languages and Programming" (J. Diaz, Ed.), Lecture Notes in Computer Science, Vol. 154, pp. 662-675, Springer-Verlag, Berlin.
47. Vickers, S. (1989), "Topology via Logic," Cambridge University Press, Cambridge, UK.
48. Vuillemin, J. (1988), Exact real arithmetic with continued fractions, in "Proc. ACM Conference on Lisp and Functional Programming," pp. 14-27.
49. Weihrauch, K. (1987), "Computability," Springer-Verlag, Berlin.
50. Weihrauch, K. (1995), "A Simple Introduction to Computable Analysis," Technical Report 171-7/1995, Fern Universität.
51. Wiedmer, E. (1980), Computing with infinite objects, Theoret. Comput. Sci. 10, 133-155.