PL Seminar: Certified Programming with Dependent Types

Overview

In this course, we will study Coq via Certified Programming with Dependent Types.


MeetingTTh 12:30-1:50pm, Tech LG52 (except the first day of class at 8am in L324)

Mailing listsubscribe / info

Github repo395-2013

Coq InstallationIf you have questions about this, post on the mailing list.

Install Coq 8.4.

Install Proof General (in Emacs).


Syllabus
DateExercises
(before class)
LeaderAssignment
Finalized by
9/24noneRobby
10/1hw1.vMax
10/3Read up to (not including) Parameterized TypesRobby9/24
10/8Continue with Inductive TypesRobby10/1
10/10Field trip10/3
10/15Finish Inductive TypesRobby10/8
10/17Read up to (not including) Predicates with Implicit Equality; solve 03-hw.vRobby10/10
10/22Finish Predicates with Implicit Equality; solve HW5.v from Pierce's classDaniel10/15
10/24Read Library Coinductive; solve HW6.vRobby10/17
10/29Read Library Subset; solve HW8 from Pierce's classBurke10/22
10/31Burke10/24
11/5Read Library GeneralRec; solve genrec_hw.vMax10/29
11/7Read Library MoreDep; solve HW10.vDylan10/31
11/12Prove that the Braun Tree insert operation preserves the Braun tree invariant.Kevin11/5
11/14Read Library DataStruct; solve HW12a.vRobby11/7
11/19Solve HW12b.vRobby11/12
11/21Read Library DataStruct; solve HW14i.v from Pierce's classZach11/14
11/26Robby11/19
12/3Benjamin11/21
12/5Michael11/26

Robby Findler