| Moon's day | Woden' s day | Frigga's day |
|---|
| |
|
Jan 20 |
|
Sets. Sets and elements. 1.(1 & 2) |
|
|
|
Jan 22 |
|
Set operations; visual verification (3-5) |
|
|
|
Jan 25 |
|
Intro to ML; cardinality and Cartesian products. 1.(6-9). |
|
|
|
Jan 27 |
|
Making things in ML. 1.(10-13). |
|
|
|
Jan 29 |
|
More about functions in ML. 1.(11-13); List. Introduction to lists. 2.(1 & 2) |
|
|
|
Feb 1 |
|
More about lists; powersets. 2.(3 & 4) |
|
|
|
Feb 3 |
|
A language processor. 2.(5 & 6) |
|
|
|
Feb 5 |
|
Proposition. Propositional forms; boolean values; logical equivalence. 3.(1-4) |
|
|
|
Feb 8 |
|
Conditionals. 3.(5-7) |
|
|
|
Feb 10 |
|
Arguments. 3.(8 & 9) |
|
|
|
Feb 12 |
|
Predicates; quantification. 3.(10-13) |
|
|
|
Feb 15 |
|
Quantification and arguments. 3.14 |
|
|
|
|
|
Feb 22 |
|
Proof. Introduction to proofs; subset proofs. 4.(1 & 2) |
|
|
|
Feb 24 |
|
Set equality proofs; set emptiness proofs. 4.(3 & 4) |
|
|
|
Feb 26 |
|
Conditional proofs. 4.(5-8) |
|
|
| |
|
Mar 3 |
|
From theorems to algorithms. 4.(10 & 11) |
|
|
|
Mar 5 |
|
Relation. Introduction. 5.(1-3) |
|
|
|
Mar 8 |
|
Properties of relations, part 1. 5.(4&5) |
|
|
|
|
Mar 12 |
|
Properties of relations, part 2. 5.(4&5) |
|
|
|
Mar 15 |
|
Transitive closure. 5.(6 & 7) |
|
|
|
Mar 17 |
|
Partial order relations; topological sort. 5.(8 & 9) |
|
|
|
Mar 19 |
|
Self Reference. Recursive types. 6.(1-3) |
|
|
| |
|
|
Mar 26 |
|
Structural induction. 6.4 |
|
|
|
Mar 29 |
|
Mathematical induction. 6.(5 & 6) |
|
|
|
Mar 31 |
|
Loop invariants, part 1. 6.(9 & 10) |
|
|
|
|
Apr 5 |
|
Loop invariants, part 1. 6.(9 & 10) |
|
|
|
Apr 7 |
|
Function. Introduction. 7.(1-3) |
|
|
|
Apr 9 |
|
Images and inverse images. 7.(4 & 5) |
|
|
|
Apr 12 |
|
Map and filter; function properties; inverse functions; composition. 7.(5-8) |
|
|
|
|
Apr 16 |
|
No-credit quiz. Countability. 7.15 |
|
|
| |
|
|
Apr 23 |
|
Map and foldl; modeling functions. 7.(5 & 14) |
|
|
|
Apr 26 |
|
Fixed-point iteration. 7.(12 & 13) |
|
|
|
Apr 28 |
|
Huffman encoding. 6.12 |
|
|
|