This tutorial will illustrate how to use the Coq proof assistant to implement effective and provably correct computation for analysis. Coq provides a dependently typed functional programming language that allows users to specify both programs and formal proofs. We will introduce dependent type theory and show how it can be used to develop both mathematics and programming. We will show how to use dependent type theory to implement constructive analysis. Specifically we will cover how to implement effective real numbers and effective integration. This work will be done using the Coq proof assistant. The tutorial will cover how to use the Coq proof assistant. Attendees are encouraged to download and install Coq 8.2 from {\tt http://coq.inria.fr/download} and also download and make the full system of C-CoRN from {\tt http://c-corn.cs.ru.nl/download.html} beforehand.
@InProceedings{spitters_et_al:OASIcs.CCA.2009.2255, author = {Spitters, Bas and O'Connor, Russell}, title = {{Computer Verified Exact Analysis}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {23--23}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2255}, URN = {urn:nbn:de:0030-drops-22554}, doi = {10.4230/OASIcs.CCA.2009.2255}, annote = {Keywords: Proof assistant, dependent type theory, constructive analysis} }
Feedback for Dagstuhl Publishing