Skip to main content
Log in

A Coherence Space of Rational Intervals for a Construction of IR

  • Published:
Reliable Computing

Abstract

A constructive computational representation of the space of real intervals IR is introduced, in a way that makes it possible to capture both its information structure relevant from a computational standpoint, and its application features as a mathematical structure. The representation consists of the Coherence Space of Rational Intervals IIQ, introduced by defining the web (IQ, ≈) of rational intervals, which is obtained from the set IQ of rational intervals on which a suitable reflexive and symmetric relation ≈ is defined. A two-fold construction of IIQ is performed, such that the internal construction of its domain-like structure leads the transformation of a suitable external algebraic structure defined on IQ into a certain one on IIQ which, when restricted to the set tot(IIQ) of total objects, becomes a structure which is order and algebraically isomorphic to the complete ordered field of the real numbers, R, and such that the family of quasi-total objects when extended with R is order and algebraically isomorphic to the set of the real intervals R.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Acióly, B. M.: Computational Foundation of Interval Mathematics, PhD Thesis, CPGCC/UFRGS, Porto Alegre, 1991.

    Google Scholar 

  2. Acióly, B., Claudio, D. M., and Dimuro, G. P.: Toward a Computational Interval Mathematics, in: Proceedings of the International Symposium On Computer Arithmetic and Scientific Computing, Oldenburg, 1991.

  3. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, New York, 1983.

    Google Scholar 

  4. Berry, G.: Stable Models of Typed Lambda Calculi, in: Proceedings of 5th ICALP Conference, Udine, 1978.

  5. Dimuro, G. P.: A Global Constructive Representation for Second Order Ordered Systems in Bi-Strutured Interval Coherence Spaces, with an Application in Interval Mathematics, PhD Thesis, CPGCC/UFRGS, Porto Alegre, 1998.

    Google Scholar 

  6. Dimuro, G. P., Acióly, B. M., and Claudio, D. M.: About Range of Functions—A Domain Approach, in: Proceedings of the International Amsze Conference Information & System, v. 2, Hangzhou, China, 1991, International Academic Publishers, Beijing, pp. 553-556.

    Google Scholar 

  7. Dimuro, G. P. and Costa, A. C. R.: A Topological Characterization for the Bi-Structured Interval Coherence Space, in: First Brazilian Workshop on Formal Methods, Porto Alegre, 1998, pp. 152-156.

  8. Dimuro, G. P., Costa, A. C. R., and Claudio, D. M.: A Coherence Space of Rational Intervals, in: Proceedings of Second Workshop on Computer Arithmetic, Interval and Symbolic Computation, Recife, 1996, pp. 26-28.

  9. Dimuro, G. P., Costa, A. C. R., and Claudio, D. M.: A Measure System for the Bi-Structured Coherence Space of Rational Intervals, in: Extended Abstracts for Interval'98—International Conference on Interval Methods and their Applications on Global Optimization, Nanjing, 1998, pp. 21-25.

  10. Dimuro, G. P., Costa, A. C. R., and Claudio, D. M.: Global Representation of Second Order Ordered Systems, in: Second Brazil Joint USA Workshop on Formal Foundations of Software Systems, New Orleans, 1997.

  11. Dimuro, G. P., Costa, A. C. R., Claudio, D. M, and Reiser, R. H. S.: Representing Data Types for Scientific Computation Using Bi-Structured Coherence Spaces, in: 3rd Workshop on Computation and Approximation, Birmingham, 1997.

  12. Edalat, A.: Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, in: Summer School on New Paradigms for Comp. on Classical Spaces/3rd Workshop on Computation and Approximation, Birmingham, 1997.

  13. Edalat, A.: Dynamical Systems, Measures and Fractals via Domain Theory, Information and Computation 120(1) (1995), pp. 32-48.

    Google Scholar 

  14. Edalat, A.: Power Domains and Iterated Functions Systems, Information and Computation 124(2) (1996), pp. 182-197.

    Google Scholar 

  15. Escardó, M. H.: PCF Extended with Real Numbers, Theoretical Computer Science 162(1) (1996), pp. 79-115.

    Google Scholar 

  16. Escardó, M. H. and Claudio, D. M.: Scott Domain Theory as a Foundation for Interval Analysis, CPGCC/UFRGS, Porto Alegre, 1993.

    Google Scholar 

  17. Fishburn, P.: Interval Orders and Interval Graphs, Wiley, New York, 1985.

    Google Scholar 

  18. Gianantonio, P.: A Functional Approach to Real Number Computation, University of Pisa, Pisa, 1993.

    Google Scholar 

  19. Gianantonio, P.: Real Number Computability and Domain Theory, Information and Computation 127(1) (1996), pp. 11-25.

    Google Scholar 

  20. Girard, J. Y.: Linear Logic, Theoretical Computer Science 50 (1987), pp. 1-102.

    Google Scholar 

  21. Girard, J. Y.: The System F of Variable Types, Fifteen Years Later, Theoretical Computer Science 45 (1986), pp. 159-192.

    Google Scholar 

  22. Girard, J. Y., Lafont, Y., and Taylor, P.: Proofs and Types, Cambridge University Press, Cambridge, 1989.

    Google Scholar 

  23. Gunter, C. A.: Semantics of Programming Languages, Structures and Techniques, MIT, New York, 1992.

    Google Scholar 

  24. Moore, R. E.: Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.

    Google Scholar 

  25. Plotkin, G.: LCF Considered as a Programming Language, Theoretical Computer Science 5(1) (1977), pp. 233-255.

    Google Scholar 

  26. Plotkin, G.: Post-Graduate Lecture Notes in Advanced Domain Theory, Department of Computer Science/University of Edinburgh, Edinburgh, 1981.

  27. Potts, P.: Exact Real Arithmetic Using Mobilus Transformations, PhD Thesis, Impirial College, London, 1998.

    Google Scholar 

  28. Scott, D.: Continuous Lattices, in: Lecture Notes in Mathematics 274, Springer, Berlin etc., 1972, pp. 97-136.

    Google Scholar 

  29. Scott, D.: Data Types as Lattices, SIAM Journal of Computing 5(1) (1976), pp. 522-587.

    Google Scholar 

  30. Scott, D.: Domains for Denotational Semantics, in: Lecture Notes in Computer Science 140, Springer, Berlin etc., 1982, pp. 577-613.

    Google Scholar 

  31. Scott, D.: Lattice Theory, Data Types and Semantics, in: Formal Semantics and Programming Languages, Prentice Hall, Englewood Cliffs, 1972, pp. 65-106

    Google Scholar 

  32. Smyth, M. B.: Effectively Given Domains, Theorical Computer Science 5(1) (1977), pp. 257-274.

    Google Scholar 

  33. Smyth, M. B.: Semi-Metrics, Closure Spaces and Digital Topology, Theoretical Computer Science 151(1) (1995), pp. 257-276.

    Google Scholar 

  34. Stoltenberg-Hansen, V., Lindstrom, I., and Griffor, E. R.: Mathematical Theory of Domains, Cambridge University Press, Cambridge, 1994.

    Google Scholar 

  35. Troelstra, A. S.: Lectures on Linear Logic, CSLI/Leland Stanford Junior University, Stanford (Lecture Notes 29), 1992.

    Google Scholar 

  36. Zhang, G.: Stable Neighbourhoods, Theoretical Computer Science 93(1) (1996), pp. 143-157.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dimuro, G.P., Costa, A.C.D.R. & Claudio, D.M. A Coherence Space of Rational Intervals for a Construction of IR. Reliable Computing 6, 139–178 (2000). https://doi.org/10.1023/A:1009913122021

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009913122021

Keywords

Navigation