Computer Verified Exact Analysis

author: Bas Spitters, Institute of Computing and Information Sciences, Radboud University Nijmegen
author: Russell O'Connor, Institute of Computing and Information Sciences, Radboud University Nijmegen
published: Aug. 24, 2009,   recorded: August 2009,   views: 8335


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 59:07
Watch Part 2
Part 2 1:06:12
Watch Part 3
Part 3 51:42


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 and also download and make the full system of C-CoRN from beforehand.

See Also:

Download slides icon Download slides: aug09_spitters_oconnor_cvia.pdf (2.4┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: