Domains for computation in mathematics, physics and exact real arithmetic

Bulletin of Symbolic Logic

Volumn 3, Issue 4, 1997, Pages 401-452

  Edalat, Abbas ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001643398     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421098     Document Type: Article

References (125)

1. S. ABRAMSKY, Domain theory in logical form, Annals of Pure and Applied Logic (1991).
2. S. ABRAMSKY and A. JUNG, Domain theory, Handbook of logic in computer science (S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors), vol. 3, Clarendon Press, 1994.
3. M. ALVAREZ, A. EDALAT, and N. SAHEB-DJAHROMI, An extension result for continuous valuations, 1997.
4. GEORGE A. BAKER, JR., Essentials of Padé approximants, Academic Press, 1975.
5. J. BANKS,J. BROOKS, G. CAIRNS, G. DAMS, and P. STACEY, On Devaney's definition of chaos, American Mathematical Monthly, vol. 99 (1992), no. 4, pp. 332-334.
6. H. P. BARENDREGT, The lambda calculus: Its syntax and semantics, revised ed., NorthHolland, 1984.
7. M. F. BARNSLEY, Fractals everywhere, second ed., Academic Press, 1993.
8. M. F. BARNSLEY and S. DEMKO, Iterated function systems and the global construction of fractals, Proceedings of the Royal Society of London, vol. A399 (1985), pp. 243-275.
9. M. F. BARNSLEY, V. ERVIN, D. HARDIN, and J. LANCASTER, Solution of an inverse problem for fractals and other sets, Proceedings of the National Academy of Science, vol. 83 (1985), pp. 1975-1977.
10. M. F. BARNSLEY and L. P. HURD, Fractal image compression, AK Peters, Ltd, 1993.
11. M. F. BARNSLEY, A. JACQUIN, L. REUTER, and A. D. SLOAN, Harnessing chaos for image synthesis, Computer graphics, 1988, SIGGRAPH proceedings.
12. M. F. BARNSLEY and A. D. SLOAN, A better way to compress images, Byte Magazine (1988), pp. 215-223.
13. U. BEHN, J. L. VAN HEMMEN, R. KÜHN, A. LANGE, and V. A. ZAGREBNOV, Multifractality in forgetful memories, Physica D, vol. 68 (1993), pp. 401-415.
14. U. BEHN, H. PATZLAFF, and A. LANGE, Generalized integrals with respect to multifractals densities and discrete stochastic mappings, draft, University of Leipzig, 1996.
15. U. BEHN and V. ZAGREBNOV, One dimensional Markovian-field Ising model: Physical properties and characteristics of the discrete stochastic mapping, Journal of Physics. B. Mathematical and General, vol. 21 (1988), pp. 2151-2165.
16. G. BIRKHOFF, Lattice theory, American Mathematical Society, 1967.
17. E. BISHOP and D. BRIDGES, Constructive analysis, Springer-Verlag, 1985.
18. J. BLANCK, Computability on topological spaces by effective domain representations, Ph.D. thesis, Uppsala University, 1997, Uppsala Dissertations in Mathematics 7.
19. _, Domain representability of metric spaces, Annals of Pure and Applied Logic, vol. 83 (1997), pp. 225-247.
20. H. J. BOEHM and R. CARTWRIGHT, Exact real arithmetic: Formulating real numbers as functions, Research topics in functional programming (D. Turner, editor), Addison-Wesley, 1990, pp. 43-64.
21. H. J. BOEHM, R. CARTWRIGHT, M. RIGGLE, and M. J. O'DONNELL, Exact real arithmetic: A case study in higher order programming, ACM symposium on lisp and functional programming, 1986.
22. P. C. BRESSLOFF and J. STARK, Neural networks, learning automata and iterated function systems, Fractals and chaos (A. J. Crilly, R. A. Earnshaw, and H. Jones, editors), Springer-Verlag, 1991, pp. 145-164.
23. P. DAVIES, The new physics, Cambridge University Press, 1989.
24. W. DE MELLO and S. VAN STRIEN, One-dimensional dynamics, Springer-Verlag, 1993.
25. R. DEVANEY, An introduction to chaotic dynamical systems, second ed., Addison-Wesley, 1989.
26. P. DI GIANANTONIO, A functional approach to real number computation, Ph.D. thesis, University of Pisa, 1993.
27. _, Real number computability and domain theory, Information and Computation, vol. 127 (1996), no. 1, pp. 11-25.
28. _, An abstract data type for real numbers, Proceedings of 24th international colloquium on automata, languages, and programming (ICALP'97), 1997.
29. P. M. DIACONIS and M. SHAHSHAHANI, Products of random matrices and computer image generation, Contemporary Mathematics, vol. 50 (1986), pp. 173-182.
30. R. M. DUDLEY, Real analysis and probability, Wadsworth & Brooks/Cole, 1989.
31. A. EDALAT, Domain of computation of a random field in statistical physics, Theory and formal methods 1994: Proceedings of the second Imperial College workshop, IC Press, 1995.
32. _, Domain theory and integration, Theoretical Computer Science, vol. 151 (1995), pp. 163-193.
33. _, Domain theory in learning processes, Proceedings of MFPS (S. Brookes, M. Main, A. Melton, and M. Mislove, editors), Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier, 1995.
34. _, Domain theory in stochastic processes, Tenth annual IEEE symposium on logic in computer science (LICS), IEEE, 1995.
35. _, Dynamical systems, measures and fractals via domain theory, Information and Computation, vol. 120 (1995), no. 1, pp. 32-48.
36. _, An algorithm to estimate the Hausdorff dimension of self-affine sets, Imperial College, 1996, draft.
37. _, Power domains and iterated function systems, Information and Computation, vol. 124 (1996), pp. 182-197.
38. _, The Scott topology induces the weak topology, Eleventh annual IEEE symposium on logic in computer science (LICS), IEEE, 1996.
39. _, When Scott is weak on the top, Mathematical Structures in Computer Science, vol. 7 (1997), pp. 401-417.
40. A. EDALAT and M. ESCARDÓ, Integration in real PCF, Eleventh annual IEEE symposium on logic in computer science (LICS), IEEE, 1996.
41. A. EDALAT and R. HECKMANN, A computational model for metric spaces, Theoretical Computer Science (1996), to appear.
42. A. EDALAT and S. NEGRI, Generalised Riemann integral on locally compact spaces, Advances in theory and formal methods of computing: Proceedings of the third Imperial College workshop (A. Edalat, S. Jourdan, and G. McCusker, editors), April 1996, full paper to appear in Topology and its applications, pp. 73-84.
43. A. EDALAT and S. NEGRI, Generalised Riemann integral on locally compact spaces, Advances in theory and formal methods of computing: Proceedings of the third Imperial College workshop (A. Edalat, S. Jourdan, and G. McCusker, editors), April 1996, full paper to appear in Topology and its applications, pp. 73-84.
44. A. EDALAT and P. POTTS, The storage capacity of forgetful neural nets, Physica D (1996), submitted.
45. A. EDALAT and P. J. POTTS, A new representation for exact real numbers, Proceedings of mathematical foundations of programming semantics 13, Electronic Notes in Theoretical Computer Science, vol. 6, Elsevier Science B. V., 1997.
46. A. EDALAT and M. B. SMYTH, Information categories, Applied Categorical Structures, vol. 1 (1993), pp. 197-232.
47. A. EDALAT and P. SÜNDERHAUF, Computable Banach spaces via domain theory, manuscript in preparation.
48. _, A domain theoretic approach to computability on the real line, Theoretical Computer Science (1997), to appear.
49. J. ELTON, An ergodic theorem for iterated maps, Journal of Ergodic Theory and Dynamical Systems, vol. 7 (1987), pp. 481-487.
50. Y. L. ERSHOV, Computable functionals of finite types, Algebra and Logic, vol. 11 (1972), no. 4, pp. 367-437.
51. M. H. ESCARDÓ, PCF extended with real numbers, Theoretical Computer Science, vol. 162 (1996), no. 1, pp. 79-115.
52. _, Properly injective spaces and function spaces, Topology and Its Applications (1997), to appear in a special issue on domain theory, guest editor Jimmie Lawson.
53. M. H. ESCARDÓ and T. STREICHER, Induction and recursion on the partial real line via biquotients of hi free algebras, Twelfth annual IEEE symposium on logic in computer science, IEEE, 1997.
54. K. FALCONER, The Hausdorff dimension of self-affine fractals, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 103 (1988), pp. 339-350.
55. _, Fractal geometry, John Wiley & Sons, 1989.
56. _, Dimension of self-affine fractals II, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 111 (1992), pp. 169-179.
57. M. J. FEIGENBAUM, The universal metric properties of nonlinear transformations, Journal of Statistical Physics, vol. 21 (1979), pp. 669-709.
58. Y. FISHER, Fractal image compression, Springer-Verlag, 1994.
59. R. C. FLAGG and R. KOPPERMAN, Computational models for ultrametric spaces, Proceedings of mathematical foundations of programming semantics 13, Electronic Notes in Theoretical Computer Science, Elsevier Science B. V., 1997.
60. G. GIERZ, K. H. HOFMANN, K. KEIMEL, J. D. LAWSON, M. MISLOVE, and D. S. SCOTT, A compendium of continuous lattices, Springer-Verlag, Berlin, 1980.
61. R. A. GORDON, The integrals of Lebesgue, Denjoy, Perron, and Henstock, Graduate Studies in Mathematics, vol. 4, American Mathematical Society, Providence, 1994.
62. W. GOSPER, Continued fraction arithmetic, HAKMEM Item 101B, MIT Artificial Intelligence Memo 239, Massachusetts Institute of Technology, 1972.
63. A. GRZEGORCZYK, Computable functionals, Fundamenta Mathematicae, vol. 42 (1955), pp. 168-202.
64. _, On the definition of computable real continuous functions, Fundamenta Mathematicae, vol. 44 (1957), pp. 61-71.
65. C. A. GUNTER, Semantics of programming languages, MIT Press, 1992.
66. S. HAYASHI, Self-similar sets as Tarski's fixed points, Publications of the Research Institute for Mathematical Sciences, vol. 21 (1985), no. 5, pp. 1059-1066.
67. R. HECKMANN, Approximation of metric spaces by partial metric spaces, Informatik-Berichte 96-04, Technische Universität Braunschweig, 1996, Workshop Domains II.
68. _, Spaces of valuations, Papers on general topology and its applications, Annals of the New York Academy of Science, vol. 806, December 1996, pp. 174-200.
69. _, The appearance of big integers in exact real arithmetic based on linear fractional transformations, submitted to ETAPS'98, 1997.
70. J. L. VAN HEMMEN, G. KELLER, and R. KÜHN, Forgetful memories, Europhysics Letters, vol. 5 (1988), no. 7, pp. 663-668.
71. R. HENSTOCK, The general theory of integration, Oxford Mathematical Monographs, Clarendon Press, 1991.
72. D. HEPTING, P. PRUSINKIEWICZ, and D. SAUPE, Rendering methods for iterated function systems, Proceedings IFIP fractals 90, 1991.
73. R. HOOFMAN, Continuous information systems, Information and Computation, vol. 105 (1993), pp. 42-71.
74. J. E. HUTCHINSON, Fractals and self-similarity, Indiana University Mathematics Journal, vol. 30 (1981), pp. 713-747.
75. P. T. JOHNSTONE, Stone spaces, Cambridge Studies in Advanced Mathematics, vol. 3, Cambridge University Press, Cambridge, 1982.
76. C. JONES, Probabilistic non-determinism, Ph.D. thesis, University of Edinburgh, 1989.
77. C. JONES and G. PLOTKIN, A probabilistic powerdomain of evaluations, Logic in computer science, IEEE Computer Society Press, 1989, pp. 186-195.
78. G. JONES and D. SINGERMAN, Complex functions, Cambridge University Press, 1987.
79. W. B. JONES and W. J. THRON, Continued fractions: Analytic theory and applications, Addison-Wesley, 1980.
80. A. JUNG, Cartesian closed categories of domains, CWI Tract, vol. 66, Centrum voor Wiskunde en Informatica, Amsterdam, 1989.
81. T. KAMIMURA and A. TANG, Total objects of domains, Theoretical Computer Science, vol. 34 (1984), pp. 275-288.
82. O. KIRCH, Bereiche und Bewertungen, Master's thesis, Technische Hochschule Darmstadt, 1993.
83. D. KNUTH, The art of computer programming, Seminumerical Algorithms, vol. 2, Addison-Wesley, 1969.
84. S. KUSUOKA, A diffusion process on a fractal, Probabilistic methods in mathematical physics, kinokuniya (K. Ito and N. Ikeda, editors), 1987, Proceedings of the Taniguchi International Symposium (Katata and Kyoto, 1985).
85. _, Dirichlet forms on fractals and products of random matrices, Research Institute far Mathematical Sciences. Publications, vol. 25 (1989), pp. 251-274.
86. D. LACOMBE, Extension de la notion de fonction recursive aux fonctions d'une ou plusieurs variables réelles I, Comptes Rendus, vol. 240 (1955), pp. 2478-80.
87. J. LAWSON, Valuations on continuous lattices, Continuous lattices and related topics (Rudolf-Eberhard Hoffmann, editor), Mathematik Arbeitspapiere, vol. 27, Universität Bremen, 1982.
88. _, Computation on metric spaces via domain theory, Topology and its applications (1996), to appear.
89. _, Spaces of maximal points, Mathematical Structures in Computer Science, vol. 7 (1997), pp. 543-556.
90. D. R. LESTER, Vuillemin's exact real arithmetic, Functional programming, Glasgow 1991: Proceedings of the 1991 workshop, Portree, UK (R. Heldal, C. K. Holst, and P. L. Wadler, editors), Springer-Verlag, Berlin, 1992, pp. 225-238.
91. V. MENISSIER-MORAIN, Arbitrary precision real arithmetic: design and algorithms, submitted to Journal of Symbolic Computation, 1996.
92. R. E. MOORE, Interval analysis, Prentice-Hall, Englewood Cliffs, 1966.
93. A. NIELSEN and P. KORNERUP, Msb-first digit serial arithmetic, J. of Univ. Comp. Scien., vol. 1 (1995), no. 7.
94. T. NORBERG, Existence theorems for measures on continuous posets, with applications to random set theory, Mathematica Scandinavica, vol. 64 (1989), pp. 15-51.
95. J. PARRY, A new algorithm for computing fractal dimension, Master's thesis, Department of Computing, Imperial College, 1996.
96. G. D. PLOTKIN, LCF considered as a programming language, Theoretical Computer Science, vol. 5 (1977), pp. 223-255.
97. _, Post-graduate lecture notes in advanced domain theory (incorporating the "Pisa Notes"), Department of Computer Science, University of Edinburgh, 1981.
98. P. POTTS, A. EDALAT, and M. ESCARDÓ, Semantics of exact real arithmetic, Twelfth annual IEEE symposium on logic in computer science, IEEE, 1997.
99. P. J. POTTS, Efficient and strict algorithms for exact real arithmetic, draft, Imperial College, 1997.
100. P. J. POTTS and A. EDALAT, Exact real arithmetic based on linear fractional transformations, draft, Imperial College, December 1996.
101. _, Exact real computer arithmetic, draft, Imperial College, March 1997.
102. M. B. POUR-EL and J. I. RICHARDS, Computability in analysis and physics, Springer-Verlag, 1988.
103. H. ROGERS, JR., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
104. W. RUDIN, Real and complex analysis, McGraw-Hill, 1966.
105. N. SAHEB-DJAHROMI, Cpo's of measures for non-determinism, Theoretical Computer Science, vol. 12 (1980), no. 1, pp. 19-37.
106. D. S. SCOTT, Outline of a mathematical theory of computation, 4th annual Princeton conference on information sciences and systems, 1970, pp. 169-176.
107. _, Continuous lattices, Toposes, algebraic geometry and logic (F. W. Lawvere, editor), Lecture Notes in Mathematics, vol. 274, Springer-Verlag, Berlin, 1972, pp. 97-136.
108. _, Models for various type-free calculi, Logic, methodology and philosophy of science IV, North-Holland, 1973, pp. 157-187.
109. _, Domains for denotational semantics, Automata, languages and programming: Proceedings 1982 (M. Nielson and E. M. Schmidt, editors), Lecture Notes in Computer Science, vol. 140, Springer-Verlag, Berlin, 1982.
110. D. R. SMART, Fixed point theorems, Cambridge University Press, 1974.
111. M. B. SMYTH, Effectively given domains, Theoretical Computer Science, vol. 5 (1977), pp. 257-274.
112. _, Power domains, Journal of Computer and System Sciences, vol. 16 (1978), no. 1, pp. 23-36.
113. _, Power domains and predicate transformers: a topological view, Automata, languages and programming (J. Diaz, editor), Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, 1983.
114. _, Topology, Handbook of logic in computer science, Chapter 5 (S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors), Oxford University Press, 1992.
115. V. STOLTENBERG-HANSEN, I. LINDSTRÖM, and E. R. GRIFFOR, Mathematical theory of domains, Cambridge Tracts in Theoretical Computer Science, vol. 22, Cambridge University Press, 1994.
116. V. STOLTENBERG-HANSEN and J. V. TUCKER, Complete local rings as domains, Journal of Symbolic Logic, vol. 53 (1988), pp. 603-624.
117. _, Effective algebras, Handbook of logic in computer science (D. Gabbay S. Abramsky and T.S.E. Maibaum, editors), vol. 4, Oxford University Press, 1995, pp. 357-526.
118. P. SÜNDERHAUF, A note on tensors in the lft approach to exact real arithmetic, manuscript, 1997.
119. S. J. VICKERS, Topology via logic, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1988.
120. _, Information systems for continuous posets, Theoretical Computer Science, vol. 114 (1993), pp. 201-229.
121. J. E. VUILLEMIN, Exact real computer arithmetic with continued fractions, IEEE Transactions on Computers, vol. 39 (1990), no. 8, pp. 1087-1105.
122. H. S. WALL, Analytic theory of continued fractions, Chelsea Publishing, 1973.
123. K. WEIHRAUCH, A foundation for computable analysis, Combinatorics, complexity, and logic, discrete mathematics and theoretical computer science (D. S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, and I. H. Witten, editors), Proceedings of DMTCS'96, Springer-Verlag, Singapore, 1997, pp. 66-89.
124. K. WEIHRAUCH and T. DEIL, Berechenbarkeit auf cpo's, Technical Report 63, Rheinisch-Westfälische Technische Hochschule Aachen, 1980.
125. K. WEIHRAUCH and U. SCHREIBER, Embedding metric spaces into cpo's, Theoretical Computer Science, vol. 16 (1981), pp. 5-24.