A Denotational Semantics for Total Correctness of Sequential Exact Real Programs

  • Thomas Anberrée
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4978)

Abstract

We provide a domain-based denotational semantics for a sequential language for exact real number computation, equipped with a non-deterministic test operator. The semantics is only an approximate one, because the denotation of a program for a real number may not be precise enough to tell which real number the program computes. However, for many first-order common functions \(f:{\mathbb R}^n \rightarrow {\mathbb R}\), there exists a program for f whose denotation is precise enough to show that the program indeed computes the function f. In practice such programs possessing a faithful denotation are not difficult to find.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Clarendon Press (1994)Google Scholar
  2. 2.
    Boehm, H.J., Cartwright, R.: Exact real arithmetic: Formulating real numbers as functions. In: Research topics in functional programming, pp. 43–64. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1990)Google Scholar
  3. 3.
    Escardó, M.H.: PCF extended with real numbers: A domain-theoretic approach to higher-order exact real number computation. PhD thesis, Department of Computing, Imperial College, University of London (1996)Google Scholar
  4. 4.
    Farjudian, A.: Sequentiality in Real Number Computation. PhD thesis, School of Computer Science, University of Birmingham (2004)Google Scholar
  5. 5.
    Di Gianantonio, P.: A Functional Approach to Computability on Real Numbers. PhD thesis, University of Pisa, Udine (1993)Google Scholar
  6. 6.
    Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications, vol. 93. Cambridge University Press, Cambridge (2003)MATHGoogle Scholar
  7. 7.
    Marcial-Romero, J.R.: Semantics of a Sequential Language for Exact Real-Number Computation. PhD thesis, School of Computer Science, University of Birmingham U.K. (2004)Google Scholar
  8. 8.
    Marcial-Romero, J.R., Escardó, M.H.: Semantics of a sequential language for exact real-number computation. Theoretical Computer Science 379(1-2), 120–141 (2007)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci. 5(3), 225–255 (1977)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Streicher, T.: Domain-Theoretic Foundations of Functional Programming. Imperial College Press, London (2006)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thomas Anberrée
    • 1
  1. 1.Division of Computer ScienceUniversity of Nottingham in NíngbōP.R. China

Personalised recommendations