Lectures
| # | date | topic | links |
|---|---|---|---|
| 1 | 04. sept. | Introduction, untyped λ-calculus | |
| 2 | 06. sept. | Introduction to Coq: Basics | html |
| 3 | 11. sept. | Untyped λ-calculus (cont.) | |
| 4 | 13. sept. | Intro. to Coq: list, induction, apply, inversion | |
| 5 | 18. sept. | Simply typed λ-calculus | |
| 6 | 20. sept. | Intro. to Coq | Exercises.v Solutions.v |
| 7 | 25. sept. | Curry-Howard correspondence | |
| 8 | 27. sept. | PLF: Small-step Operational Semantics | html |
| 9 | 02. oct | PLF: Type Systems | html |
| 10 | 04. oct. | PLF: Simply typed λ-calculus | html |
| 11 | 09. oct. | Curry-Howard correspondence (cont.) | |
| 12 | 11. oct. | PLF: Properties of STλC | html |
| 13 | 16. oct. | 2nd-order λ-calculus | |
| 14 | 18. oct. | (no lecture due to medical emergency -- sorry) | |
| 15 | 23. oct. | Type inference; Hindley-Milner type system | |
| 16 | 25. oct. | PLF: Properties of STλC (cont.) | |
| 17 | 30. oct. | PLF: Extensions of STλC | link |
| 18 | 01. nov. | PLF: Extensions of STλC (cont.) | |
| 19 | 06. nov. | The λ-cube; pure type systems | |
| 20 | 08. nov. | Dependent type programming in Coq | |
| 21 | 13. nov. | The λ-cube; pure type systems (cont.) | |
| 22 | 15. nov. | Dependent type programming in Coq (cont.) | DepT.v |
| 23 | 20. nov. | Subtyping | |
| 24 | 22. nov | PLF: Subtyping | |
| 25 | 27. nov. | Subtyping (cont.) | |
| 26 | 29. nov. | PLF: Subtyping (cont.) |
Additional chapters
If you already know the basics of Coq, study:
- Exercises from "Intro to Interactive Theroem proving" y1.v, y2.v, y3.v, y4.v, y5.v. (UTF-8 encoded)
- no need to finish everything
- Induction Principles
- Properties of Relations