We meet every Tuesday and Thursday from 11pm to 12:20pm in Searle 1441. Schedule provides more details for each meeting.
Use Piazza for discussion about the class.
In this class we will explore properties that programs can have, first focusing on stating them in a precise and checkable way. As the quarter progresses, we will explore how to prove they are correct using Agda.
You will be expected to solve homework assignments that test your understanding of the concepts and then design (in consultation with the instructor) a final project where you state and prove a property of a program.
Introduction & our First Properties
Random-test Driven Development
Exploring some Properties
Introduction to Agda
Working with Numbers
More with Numbers
Lists (cotd), Internal Verification, Nonzero
Binary Search Trees bst.agda
Correctness of BSTs bst-works.agda