MSc-level course at Vrije Universiteit Amsterdam, computer science
Academic year 2019–2020, period 2
This courses introduces the proof assistant Lean, its type-theoretic foundations, and its applications to mathematics and computer science.
A proof assistant is used to check the correctness of a specification of a program or the proof of a mathematical theorem. The course is concerned with the proof assistant Lean, a system that is developed primarily at Microsoft Research. In the practical work, we learn to use Lean. We will see how to use the system to prove mathematical theorems in a precise, formal way, and how to verify small functional programs (e.g., a sorting algorithm). In the course, we focus on its dependent type theory and on the Curry–Howard–De Bruijn correspondence between proofs and functional programs (λ-terms). These concepts are the basis of Lean but also of other popular systems, including Agda, Coq, and Matita.
See the official rooster.
The course is oriented towards the application of proof assistants to computer science and mathematics. We will use Lean, a modern system developed at Microsoft Research. In each lecture, we will review a Lean file, which can be downloaded from the materials section below.
If you need to contact us, please email both lecturers (J.C. Blanchette and A. Bentkamp), with [LoVe] in the subject line. We will monitor Canvas regularly. You can also use Canvas for discussions and questions related to Lean.
Although the course is application-driven, this is a university course, so theory is important as well. We will cover it as it emerges, but you are expected to read the materials we refer to.
To each lecture (on Mondays and Thursdays) corresponds some notes in Markdown format (e.g., love01_definitions_and_lemma_statements.md), a Lean demo file (e.g., love01_definitions_and_lemma_statements_demo.lean), a Lean exercise sheet (e.g., love01_definitions_and_lemma_statements_exercise_sheet.lean) and a Lean homework sheet (e.g., love01_definitions_and_lemma_statements_homework_sheet.lean). The exercises are crucial; theorem proving can only be learned by doing. We will assist you during the group exercises (on Tuesdays and Fridays) and answer questions on Canvas. We will also help you set up Lean and Visual Studio Code on your computer. See below for links to software and installation instructions.
For the group exercises, we strongly recommend that you bring your own wine^H^H^H^Hlaptop.
The homework given at the nth lecture is due by noon of the day of (n + 3)rd lecture. The homework counts for 25% of the final grade.
The course will consist of 14 lectures:
This year's course is the second of its kind, with the emphasis on practical applications and on dependent type theory in Lean. Below you will find a mock exam as well as some exams from previous years for related courses at the VU and the Universität des Saarlandes in Saarbrücken. These give a rough idea of what "formal proofs on paper" can look like.
Please note that the pre-2018 Logical Verification course had a stronger focus on the metatheory of dependent type theory and on the Curry–Howard correspondence (and less on practical applications), and the course in Saarbrücken covered Isabelle/HOL and language semantics, going well beyond what we achieve in part III of the current course.