Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis
MPC '98 Proceedings of the Mathematics of Program Construction
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
Affine functions and series with co-inductive real numbers
Mathematical Structures in Computer Science
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Semantics of a sequential language for exact real-number computation
Theoretical Computer Science
Hybrid Functional Interpretations
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Coinduction for Exact Real Number Computation
Theory of Computing Systems
Realizability interpretation of proofs in constructive analysis
Theory of Computing Systems
Continuous Functions on Final Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability for Monotone and Clausular (Co)inductive Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
From coinductive proofs to exact real arithmetic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Exploring the Computational Content of the Infinite Pigeonhole Principle
Journal of Logic and Computation
Minlog: a tool for program extraction supporting algebras and coalgebras
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Typed vs. Untyped Realizability
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
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.