Term rewriting for normalization by evaluation
Information and Computation - Special issue: ICC '99
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
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
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Coinduction for Exact Real Number Computation
Theory of Computing Systems
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
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
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Proofs and Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Minlog is an interactive system which implements proof-theoretic methods and applies them to verification and program extraction. We give an overview of Minlog and demonstrate how it can be used to exploit the computational content in (co)algebraic proofs and to develop correct and efficient programs. We illustrate this by means of two examples: one about parsing, the other about exact real numbers in signed digit representation.