Textbooks and Software
The primary text is Software Foundations
by Pierce et al., a software
verification and programming languages course available free and online.
Before the first day of class, I encourage you to download and install
the Coq proof assistant
, the tool upon
which Software Foundations is based.
Two IDEs for Coq are available, the Emacs-based ProofGeneral and CoqIDE
(bundled with Coq). I recommend CoqIDE for new Coq users (this is also
the IDE we'll be using in class); ProofGeneral is good but requires
more setup and some Emacs experience.
Periodically I may assign additional supplementary (optional
but recommended) readings from
Types and Programming Languages, Benjamin Pierce, and from
The Formal Semantics of Programming Languages, Glynn Winskel. Both
of these books are available on Amazon.
Some mathematical maturity (at the level of "I've seen and done proofs before"),
facility with a couple different programming languages,
and a desire to learn.
The course consists of twice-weekly lectures (Mondays and Wednesdays)
and a weekly lab (Fridays), during which I'll be around
to help with problems you may encounter completing the homeworks.
In addition to the weekly homework assignments, drawn primarily
from Software Foundations, there will be a take-home midterm exam
(Week 7, approximately 15% of your grade) and a final project (Week
15, approximately 35%). The weekly homeworks and attendance at lecture
and lab are worth approximately 50%.
Blackboard will be used only to report grades.
Up-to-date information on all other
aspects of the course (assignment due dates, etc.) will be posted
on this website.
The schedule is subject to revision.
Functional Programming, Coq
More functional programming: polymorphism, implicit arguments,
higher-order functions. Coq proof strategies, additional tactics.
Homework: Assignment 1
Monday, September 4: Labor Day, no class
Logic in Coq
Modeling and Proving Systems
The little imperative language Imp.
Winskel, Ch. 2, Secs. 2.1-2.5.
Homework: Assignment 4
Interlude: More Functional Programming (!) in Coq
Take-home Midterm: due Wednesday, 10/18
Tuesday, October 10: Fall Semester Reading Day,
Lambda Calculus and Type Systems
Small-step Operational Semantics.
Winskel, Ch. 2, Sec. 2.6.
: Assignment 7
Untyped Lambda Calculus, Simply-Typed Lambda Calculus.
TAPL, Chs. 5 and 9.
: Assignment 9
Friday, November 10: Veterans Day, no class
Concurrent and Distributed Systems
November 22-24: Thanksgiving Break, no classes
Concurrent systems, pi calculus
December 11-15: Final Exams
(a) An ability to apply knowledge of computing and mathematics appropriate to the program's student outcomes and to the discipline. Students will be able to:
Design and implement inductively defined data types to solve
Design and implement recursive functions over inductively defined data types in order to solve computational problems
Model the behavior of an imperative programming language using operational semantics
(b) An ability to analyze a problem, and identify and define the computing requirements appropriate to its solution. Students will be able to:
Analyze a type system in order to prove metatheoretic properties like type soundness
Analyze a program in order to identify specifications (Hoare-logic pre- and post-conditions) that capture the program's expected behavior
(c) An ability to design, implement, and evaluate a computer-based system, process, component, or program to meet desired needs. Students will be able to:
Use an interactive theorem prover to mechanically prove type soundness for a small arithmetic expression language
Use an interactive theorem prover to prove type soundness for the simply-typed lambda calculus
Extend a mechanical proof of type soundness for the simply-typed lambda calculus to support additional features such as products or sums
Use an interactive theorem prover to build a mechanical Hoare-logic proof of safety for a small imperative program
(j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices. Students will be able to:
Reason about, and recognize the tradeoffs of, various definitions of program
equivalence with respect to a language's operational semantics
Homework and Collaboration Policies
Academic Honesty Policy
Acceptable Collaboration Matrix
|Instructor/GA||Noninstructor (e.g., Another Student)|
|You||all collaboration allowed||high-level discussion
(of the problems, not your code!)
allowed but only after you've started the assignment;
must be documented in README as described below|
You may discuss the homework with other students in
the class, but only after you've attempted the problems on your own
first. If you do discuss the homework problems with others, write the
names of the students you spoke with, along with a brief summary of
what you discussed, in a README comment at the top of each
README Gordon Stewart, Assn #1
I worked with X and Y. We swapped tips regarding the use of Coq's "rewrite" tactic. *)
However, under no circumstances are you permitted
to share or directly copy code or other written homework material,
except with course instructors.
If I discover that you've cheated on an
assignment, you'll get an automatic 0 along with an immediate
referral to the
Office of Community Standards, which will likely
take disciplinary action against you.
Remember: homework is there to give *you* practice in
the new ideas and techniques covered by the course; it does you no
good if you don't engage!
In general, students in EECS courses such as this one must
adhere to the Russ College of Engineering and Technology Honor
Code, and to the OU
Student Code of Conduct. If you haven't ever read these documents,
please do so.
Students with Disabilities
If you suspect you may need an accommodation based on the impact of a
disability, please contact me privately to discuss your specific
needs. If you're not yet registered as a student with a disability,
contact the Office of Student