Bring your computer
Bas Spitters
We will be using the discussion board on Blackboard for general discussions about the exercises, projects, and Coq. Your posts are anonymized, so do not feel hesitant against using it.
During this course we will be using the Coq proof
assistant.
Coq is both a functional programming language, as well as a system that allows
one to reason using formal proofs about one's programs.
Information on installing Coq is
available here. I recommend a recent version of Coq (8.12).
The Windows installer is available here. Alternatives are here.
There is also the experimental Coq Platform.
Choose an IDE. I recommend vscode or emacs.
One can read logical foundations in the browser and use jscoq for collaborative editing. This is still experimental though.
We will be using part of the online textbook Software Foundations by Benjamin C. Pierce et al.
The course includes a track of weekly exercises.
Submission and approval of 10 mandatory assignments is required.
Five assignments from the first seven weeks and five from the second.
Work in groups of two (maximally three) is encouraged.
The exercises should be handed in each Friday following the TA session before 10:00.
Coq should accept the homework handed in as a .v file in its entirety. The exercise will not be graded if Coq does not accept the file. Use Admitted to make Coq accept incomplete proofs.
You are not allowed to use Coq tactics in the homework that we have not yet discussed (for example tauto, eauto and omega are forbidden).Date  Topics  Course material 

week 36  Installing Coq Basic inductive types Proving using computation Rewriting 
Preface
and Basics
and Induction 
week 37  Lists and Polymorphic functions  Lists
and
Polymorphic functions

week 38  Tactics and Logic  Tactics
and
Logic

Week 39  Inductively defined propositions  IndProp

Week 40  ProofObjects, IndPrinciples 
Maps,
ProofObjects,
Rel,
IndPrinciples

Week 41  Imp  Imp

Week 43  Auto  Auto

Week 44  lambdacalculus and combinators  Notes, Combinatris 
Week 45  Simple type theory and System F  Notes, Slides

Week 46  Fomega and Calculus of Constructions  Notes, Slides, More
Slides

Week 47  Programming with Dependent types  Lecture,
Equations
manual, Equations
introduction,
Slides

Week 48  Type Classes  
Week 49  Monads  vfile, Exercises

Week 50  QuickChick 
The course finishes with a Coq project, a list of suggestions can be found here and here. You may also invent a Coq project yourself or do a variation or extension of one of our suggested projects. If you invent a project yourself or use a variation of the suggestions, you have to discuss it with the lecturer.
You are allowed to work in groups. You may also write the report together. However, you are fully responsible for the code and the report. The oral exam will test your understanding.
In order to complete the Coq project, you have to make the following deliverables:
The written report has to be 5 to 10 pages, should be in academic style, and should include:
You should not include unnecessarily long excerpts of Coq code, just use small fragments to illustrate a point. Informal proofs should be formulated in the way taught during the course. Do not paraphrase Coq proofs in natural language by writing: and now we apply tactic X so our goals becomes Y.
Grade reflects an overall assessment of:
Only students with approved exercises can attend the oral exam and thus pass the course.
The grade of the Coq project is based on the following items:
During the oral exam we will test your understanding of the
project. E.g. by asking you to create a small
extension of the project, to explain proofs of the project in an
informal way, to query you about the contents of your report, or ask general
questions about the contents of the course.
Bring your laptop!