Induction and Recursion on the Partial Real Line with Applications to Real PCF

The partial real line is an extension of the Euclidean real line with partial real numbers, which has been used to model exact real number computation in the programming language Real PCF. We introduce induction principles and recursion schemes for the partial unit interval, which allow us to verify that Real PCF programs meet their specification. They resemble the so-called Peano axioms for natural numbers. The theory is based on a domain-equation-like presentation of the partial unit interval. The principles are applied to show that Real PCF is universal in the sense that all computable elements of its universe of discourse are definable. These elements include higher-order functions such as integration operators.

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

[2]  Richard S. Bird,et al.  Introduction to functional programming , 1988, Prentice Hall International series in computer science.

[3]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[4]  Robert L. Constable,et al.  Computability Concepts for Programming Language Semantics , 1976, Theor. Comput. Sci..

[5]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  Peter Lucas,et al.  Formal Semantics of Programming Languages: VDL , 1981, IBM J. Res. Dev..

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

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

[9]  P. J. Freyd.  Applications of Categories in Computer Science: Remarks on algebraically compact categories , 1992 .

[10]  Martín Hötzel Escardó,et al.  Properly injective spaces and function spaces , 1998 .

[11]  Thomas Streicher,et al.  Real PCF extended with is universal (Extended Abstract) , 1996 .

[12]  G. Plotkin.  Tω as a Universal Domain , 1978 .

[13]  Horst Herrlich,et al.  Abstract and concrete categories , 1990 .

[14]  M. Fourman,et al.  I-categories and duality , 1992 .

[15]  Ionel Bucur,et al.  Toposes, Algebraic Geometry and Logic , 1972 .

[16]  Axel Poigné,et al.  Basic category theory , 1993, LICS 1993.

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

[18]  Thomas Streicher,et al.  A universality theorem for PCF with recursive types, parallel-or and ∃ , 1994, Mathematical Structures in Computer Science.

[19]  M. In,et al.  Real PCF extended with 9 is universal (Extended Abstract , 1996 .

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

[21]  David Michael Ritchie Park,et al.  When are two Effectively given Domains Identical? , 1979, Theoretical Computer Science.

[22]  Abbas Edalat,et al.  A Domain-Theoretic Approach to Computability on the Real Line , 1999, Theor. Comput. Sci..

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

[24]  Abraham Adolf Fraenkel,et al.  Set theory and logic , 1966 .

[25]  Dana S. Scott,et al.  A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..

[26]  Steven Vickers,et al.  Applications of Categories in Computer Science: Geometric theories and databases , 1992 .

[27]  Thomas Streicher,et al.  Induction and recursion on the partial real line via biquotients of bifree algebras , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[28]  Marcelo P. Fiore,et al.  A coinduction principle for recursive data types based on bisimulation , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

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

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

[32]  P. Freyd.  Algebraically complete categories , 1991 .