On the non-sequential nature of the interval-domain model of real-number computation

Mathematical Structures in Computer Science

Volumn 14, Issue 6, 2004, Pages 803-814

  Escardo, Martin ^a   Hofmann, Martin ^b   Stretcher, Thomas ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84986566571     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129504004360     Document Type: Article

References (14)

1. Abramsky, S. and Jung, A. (1994) Domain theory. In: Abramsky, S., Gabbay, D. and Maibaum, T. (eds.) Handbook of Logic in Computer Science 3, Clarendon Press 1–168.
2. Amadio, R. and Curien, P.L. (1998) Domains and Lambda-Calculi, Cambridge Tracts in Theoretical Computer Science 46, Cambridge University Press.
3. Boehm, H. and Cartwright, R. (1990) Exact real arithmetic: Formulating real numbers as functions. In: Turner. D. A. (ed.) Research Topics in Functional Programming, Addison-Wesley 43–64.
4. Edalat, A. (1997) Domains for computation in mathematics, physics and exact real arithmetic. Bulletin of Symbolic Logic 3 (4) 401–452.
5. Escardo, M. (1996) PCF extended with real numbers. Theoretical Computer Science 162 (1) 79–115.
6. Escardo, M. and Streicher, T. (1999) Induction and recursion on the partial real line with applications to Real PCF. Theoretical Computer Science 210 (1) 121–157.
7. Farjudian, A. (2003) Sequentiality and piece-wise affinity in segments of Real-PCF. Electronic Notes in Theoretical Computer Science 73.
8. Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M. and Scott, D. (2003) Continuous lattices and domains, Cambridge University Press.
9. Luckhardt, H. (1977) A fundamental effect in computations on real numbers. Theoretical Computer Science 5 321–324.
10. Mislove, M. (1998) Topology, domain theory and theoretical computer science. Topology and its Applications 89 (1–2) 3–59.
11. Plotkin, G. (1977) LCF considered as a programming language. Theoretical Computer Science 5 (1) 223–255.
12. Plotkin, G. (1983) Pisa notes on domains. Department of Computer Science, University of Edinburgh. (Available at http://www.dcs.ed.ac.uk/home/gdp/publications/.)
13. Rogers, H. (1967) Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York.
14. Scott, D. (1972) Lattice theory, data types and semantics. In: Rustin, R. (ed.) Formal semantics of programming languages. Courant Computer Science Symposis 2, Prentice-Hall 65–106.