Computable analysis and notions of continuity in Coq

@article{Steinberg2021ComputableAA,
  title={Computable analysis and notions of continuity in Coq},
  author={Florian Steinberg and Laurent Th{\'e}ry and Holger Thies},
  journal={Log. Methods Comput. Sci.},
  year={2021},
  volume={17}
}
We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the sense of computable analysis. The development is done in the proof assistant Coq and heavily relies on the Incone library for information theoretic continuity. This library is developed by one of the authors and the paper can be used as an introduction to… Expand
2 Citations

Figures from this paper

Continuous and monotone machines
TLDR
A variant of the fuel-based approach to modeling diverging computation in type theories is investigated and used to abstractly capture the essence of oracle Turing machines and it is proved that it is possible to translate back and forth between such machines and names in the standard function encoding used in computable analysis. Expand
Computable Analysis for Verified Exact Real Computation
TLDR
A general framework to define real number algorithms independently of their concrete encoding and to prove them correct is defined and algorithms verified in this framework can be extracted to Haskell programs for efficient computation. Expand

References

SHOWING 1-10 OF 73 REFERENCES
The realizability approach to computable analysis and topology
In this dissertation, I explore aspects of computable analysis and topology in the framework of relative realizability. The computational models are partial combinatory algebras with subalgebras ofExpand
Complexity Theory for Operators in Analysis
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be representedExpand
Formalization of real analysis: a survey of proof assistants and libraries †
TLDR
This survey presents how real numbers have been defined in these various provers and how the notions of real analysis described above have been formalized. Expand
Formal proof of polynomial-time complexity with quasi-interpretations
TLDR
A Coq library based on quasi-interpretations that, in combination with termination ordering, provide a characterisation of the class fp of functions computable in polynomial time is presented. Expand
Effective Choice and Boundedness Principles in Computable Analysis
TLDR
This paper develops a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Expand
A constructive manifestation of the Kleene-Kreisel continuous functionals
TLDR
It is shown that this category equivalent to that of Kleene–Kreisel continuous functionals has a fan functional and validates the uniform-continuity principle in these theories. Expand
Computability and analysis: the legacy of Alan Turing
TLDR
The theory of probability, which was born in an exchange of letters between Blaise Pascal and Pierre de Fermat in 1654 and developed further by Christian Huygens and Jakob Bernoulli, provided methods for calculating odds related to games of chance. Expand
Relative computability and uniform continuity of relations
TLDR
A concept of uniform continuity based on the Henkin quantifier is proposed and proved necessary for relative computability of compact real relations, which is a strict hierarchy of notions each necessary — and the ω-th level also sufficient — forrelative computability. Expand
Closed choice and a Uniform Low Basis Theorem
TLDR
It is shown that with closed choice one can characterize several models of hypercomputation in a uniform framework using Weihrauch reducibility and a Quotient Theorem for compact choice shows that single-valued functions can be “divided” by compact choice in a certain sense. Expand
Essential Incompleteness of Arithmetic Verified by Coq
TLDR
A constructive proof of the Godel-Rosser incompleteness theorem has been completed using Coq proof assistant, and Peano arithmetic is proved to be consistent in Coq's type theory and therefore is incomplete. Expand
...
1
2
3
4
5
...