Integration in Real PCF

Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it is possible to compute an arbitrarily small rational interval containing the real number in a sufficiently large number of steps. Based on a domain-theoretic approach to integration, we show how to define integration in Real PCF. We propose two approaches to integration in Real PCF. One consists in adding integration as primitive. The other consists in adding a primitive for maximization of functions and then recursively defining integration from maximization. In both cases we have an adequacy theorem for the corresponding extension of Real PCF. Moreover based on previous work on Real PCF definability, we show that Real PCF extended with the maximization operator is universal, which implies that it is also fully abstract.

[1]  Abbas Edalat.  Domain theory in stochastic processes , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

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

[3]  S. Vickers.  Topology via Logic , 1989 .

[4]  Robert Cartwright,et al.  Exact real arithmetic formulating real numbers as functions , 1990 .

[5]  M. B. Pour-El,et al.  COMPUTABILITY AND NONCOMPUTABILITY IN CLASSICAL ANALYSIS , 1983 .

[6]  Martín Hötzel Escardó,et al.  PCF extended with real numbers : a domain-theoretic approach to higher-order exact real number computation , 1997 .

[7]  Thomas Streicher,et al.  Induction and Recursion on the Partial Real Line with Applications to Real PCF , 1999, Theor. Comput. Sci..

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

[9]  Abbas Edalat.  Domain Theory and Integration , 1995, Theor. Comput. Sci..

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

[11]  Michael B. Smyth,et al.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[12]  Abbas Edalat,et al.  Semantics of exact real arithmetic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[13]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

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

[15]  E. Wiedmer,et al.  Computing with Infinite Objects , 1980, Theor. Comput. Sci..

[16]  Jean Vuillemin,et al.  Exact real computer arithmetic with continued fractions , 1988, IEEE Trans. Computers.

[17]  Abbas Edalat,et al.  Domain of Computation of a Random Field in Statistical Physics , 1994, Theory and Formal Methods.

[18]  Abbas Edalat,et al.  When Scott is weak on the top , 1997, Mathematical Structures in Computer Science.

[19]  Hans-Juergen Boehm,et al.  Exact real arithmetic: a case study in higher order programming , 1986, LFP '86.

[20]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[21]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[22]  Abbas Edalat.  Domain theory in learning processes , 1995, MFPS.

[23]  P. Martin-Löf.  Notes on constructive mathematics , 1970 .

[24]  Claude Brezinski,et al.  Complexity theory of real functions , 1992 .

[25]  M. In,et al.  INDUCTION AND RECURSION ON THE REAL LINEMART , 2022 .

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

[27]  David Turner,et al.  Research topics in functional programming , 1990 .

[28]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[29]  Abbas Edalat.  The Scott topology induces the weak topology , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[30]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[31]  L. Blum.  A Theory of Computation and Complexity over the real numbers , 1991 .

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