Proofs, Programs, Processes

We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this interpretation is that realisers are given by terms that correspond directly to programs in a lazy functional programming language such as Haskell. Programs extracted from proofs using coinduction can be understood as perpetual processes producing infinite streams of data. Typical applications of such processes are computations in exact real arithmetic. As an example we show how to extract a program computing the average of two real numbers w.r.t. to the binary signed digit representation.

[1]  Dirk Pattinson,et al.  Continuous Functions on Final Coalgebras , 2009, CMCS.

[2]  Makoto Tatsuta.  Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis , 1998, MPC.

[3]  Herman Geuvers,et al.  Constructive analysis, types and exact real numbers , 2007, Mathematical Structures in Computer Science.

[4]  Trifon Trifonov,et al.  Exploring the Computational Content of the Infinite Pigeonhole Principle , 2012, J. Log. Comput..

[5]  Paulo Oliva,et al.  Hybrid Functional Interpretations , 2008, CiE.

[6]  Favio E. Miranda-Perea.  Realizability for Monotone and Clausular (Co)inductive Definitions , 2005, Electron. Notes Theor. Comput. Sci..

[7]  Zuber,et al.  Proof Theory at Work: Program Development in the Minlog System , 1998 .

[8]  José Raymundo Marcial-Romero,et al.  Semantics of a sequential language for exact real-number computation , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[9]  Ulrich Berger,et al.  Coinduction for Exact Real Number Computation , 2007, Theory of Computing Systems.

[10]  Ulrich Berger,et al.  From Coinductive Proofs to Exact Real Arithmetic , 2009, CSL.

[11]  Abbas Edalat,et al.  Computing with real numbers. I. The LFT approach to real number computation. II. A domain framework for computational geometry , 2002 .

[12]  Ulrich Berger,et al.  Realisability and Adequacy for (Co)induction , 2009, CCA.

[13]  Helmut Schwichtenberg,et al.  Realizability interpretation of proofs in constructive analysis , 2008, Theory of Computing Systems.

[14]  Alberto Ciaffaglione,et al.  A certified, corecursive implementation of exact real numbers , 2006, Theor. Comput. Sci..

[15]  Yves Bertot,et al.  Affine functions and series with co-inductive real numbers , 2006, Mathematical Structures in Computer Science.

[16]  Milad Niqui.  Coinductive Formal Reasoning in Exact Real Arithmetic , 2008, Log. Methods Comput. Sci..