A Coherence Space of Rational Intervals for a Construction of IR

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.

[1]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

[2]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[3]  J. Girard,et al.  Proofs and types , 1989 .

[4]  A. Troelstra.  Lectures on linear logic , 1992 .

[5]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[6]  Abbas Edalat,et al.  Domains for Computation in Mathematics, Physics and Exact Real Arithmetic , 1997, Bulletin of Symbolic Logic.

[7]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[8]  Abbas Edalat,et al.  Power Domains and Iterated Function Systems , 1996, Inf. Comput..

[9]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[10]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[11]  Pietro Di Gianantonio.  Real Number Computability and Domain Theory , 1996, Inf. Comput..

[12]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[13]  Michael B. Smyth,et al.  Effectively given Domains , 1977, Theor. Comput. Sci..

[14]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[15]  Abbas Edalat,et al.  Dynamical Systems, Measures and Fractals via Domain Theory , 1993, Inf. Comput..

[16]  Martín Hötzel Escardó,et al.  PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..

[17]  Guo-Qiang Zhang.  Stable Neighbourboods , 1992, Theor. Comput. Sci..

[18]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[19]  Michael B. Smyth,et al.  Semi-Metrics, Closure Spaces and Digital Topology , 1995, Theor. Comput. Sci..

[20]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[21]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..