| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
|
| |
|
|
| |
|
|
Sept 8 |
|
Powersets; a language processor. 2.(4-6)
Slides |
|
|
|
Sept 11 |
|
Proposition. Propositional forms; boolean values; logical equivalence. 3.(1-4)
Slides |
|
|
|
Sept 13 |
|
Conditionals. 3.(5-7)
Slides |
|
|
|
Sept 15 |
|
Arguments. 3.(8 & 9)
Slides |
|
|
|
Sept 18 |
|
Predicates; quantification. 3.(10-13)
Slides |
|
|
|
Sept 20 |
|
Quantification and arguments. 3.14
Slides |
|
|
|
| |
|
Sept 27 |
|
Proof. Introduction to proofs; subset proofs. 4.(1 & 2)
Slides |
|
|
|
Sept 29 |
|
Set equality proofs; set emptiness proofs. 4.(3 & 4)
Slides |
|
|
|
Oct 2 |
|
Conditional proofs. 4.(5-8)
Slides |
|
|
|
|
Oct 6 |
|
From theorems to algorithms. 4.(10 & 11)
Slides |
|
|
|
Oct 9 |
|
Relation. Introduction. 5.(1-3)
Slides |
|
|
|
Oct 11 |
|
Properties of relations, part 1. 5.(4&5)
Slides |
|
|
|
Oct 13 |
|
Properties of relations, part 2. 5.(4&5) |
|
|
| |
|
|
Oct 20 |
|
Transitive closure. 5.(6 & 7)
Slides |
|
|
|
Oct 23 |
|
Partial order relations; topological sort. 5.(8 & 9)
Slides |
|
|
|
|
|
Oct 30 |
|
Self Reference. Recursive types. 6.(1-3)
Slides |
|
|
|
Nov 1 |
|
Structural induction. 6.4
Slides |
|
|
|
Nov 3 |
|
Mathematical induction. 6.(5 & 6)
Slides |
|
|
|
Nov 6 |
|
Loop invariants, part 1. 6.(9 & 10)
Slides |
|
|
|
Nov 8 |
|
Loop invariants, part 2. 6.(9 & 10) |
|
|
|
Nov 10 |
|
Function. Introduction. 7.(1-3)
Slides |
|
|
|
Nov 13 |
|
Images and inverse images. 7.(4 & 5)
Slides |
|
|
|
Nov 15 |
|
Map and filter; function properties; inverse functions; composition. 7.(5-8)
Slides |
|
|
|
|
Nov 20 |
|
No-credit quiz. Countability. 7.15
Slides |
|
|
|
|
| |
|
|
Dec 1 |
|
Map and foldl; modeling functions. 7.(5 & 14)
Slides |
|
|
|
Dec 4 |
|
Fixed-point iteration. 7.(12 & 13)
Slides |
|
|
|
Dec 6 |
|
Huffman encoding. 6.12
Slides |
|
|
|