Moon's day  Woden' s day  Frigga's day 






Jan 20 
More about functions in ML. 1.(1113); List. Introduction to lists. 2.(1 & 2) Code from class 
Pg 48: 1.11.(4, 8, 10) Pg 5051: 1.12.(3, 5, 8) Pg 70: 2.1.(24) Starting with this assignment, submit ML problems electronically Recommendation: start working on problems from 2.2 assigned next time Skim 2.3 Read 2.4 Optional: Video for Section 2.4


Jan 23 
More about lists; powersets. 2.(3 & 4) Code from class 
Pg 74: 2.2.(2, 3, 8, 9, 11, 13, 15) Pg 82: 2.4.(812) Read carefully 2.5 Skim 2.6



Jan 27 
Proposition. Propositional forms; boolean values; logical equivalence. 3.(14) Slide Code from class 
Pg 102: 3.3.(5 & 6) Pg 105: 3.4.(2, 4, 812) Read 3.(57)


Jan 30 
Conditionals. 3.(57) Slides Code from class 
Pg 108: 3.5.(1 & 2) Pg 114: 3.7.(1, 2, 7, 8, 9, 12, 13) Read 3.(8 & 9)


Feb 1 
Arguments. 3.(8 & 9) Slides 
Pg 119: 3.8.(3 & 5) Pg 122: 3.9.(37) Read carefully 3.(10 & 11) Skim 3.(12 & 13)


Feb 3 
Predicates; quantification. 3.(1013) Code from class 
Pg 133: 3.12.(1 & 2) Pg 135:3.13.(4 & 5) Read 3.14


Feb 6 
Quantification and arguments. 3.14 Slides 
Pg 139: 3.14(69)




Feb 13 
Proof. Introduction to proofs; subset proofs. 4.(1 & 2) Slide 
Pg 158:4.2.(27) Review 4.(1 & 2) Read 4.(3 & 4)


Feb 15 
Set equality proofs; set emptiness proofs. 4.(3 & 4) 
Pg 160: 4.3.(3, 14, 15, 18) Pg 161: 4.4.(5,6) Read 4.(58)


Feb 17 
Conditional proofs. 4.(58) 
Pg 162: 4.5.(1, 4, 5) Pg 164: 4.6.(2,5) Pg 165: 4.7.(1, 6) Review 2.4, especially Ex 2.4.15 Skim 4.9



Feb 22 
Powersets. 4.9 
Pg 174: 4.9.(1, 3, 4, 6) Skim 4.(10 & 11)


Feb 24 
From theorems to algorithms. 4.(10 & 11) 
Pg 177: 4.10.(3, 4, 6) Correction to Ex 4.10.6 Read carefully 5.1 Read 5.(2 & 3)



Mar 1 
Properties of relations. 5.4 
Pg 205: 5.3.(5, 6, 11, 14) Pg 208: 5.4.(35, 22, 24, 25, 26) Pg 212: 5.5.(5, 7, 9, 10) All above due Mar 13 Read 5.5


Mar 3 
Equivalence relations. 5.5 
See Mar 1 for assignment Read 5.(6 & 7)





Mar 13 
Transitive closure. 5.(6 & 7) 
Pg 217: 5.6.(1&3) Pg 222: 5.7.(3&5) Read 5.(8 & 9)


Mar 15 
Partial order relations; topological sort. 5.(8 & 9) 
Pg 226: 5.8.(15) Pg 231 5.9.(1 & 8)




Mar 22 
Self Reference. Recursive types. 6.(13) 
Pg 260: 6.2.(68, 1417) Read 6.4


Mar 24 
Structural induction. 6.4 
Pg 268: 6.4.(3,4,6,7) Skim 6.(5 & 6)


Mar 27 
Mathematical induction. 6.(5 & 6) 
Pg 273: 6.5.(2 & 4) Pg 278: 6.6.(2 & 3). Read 6.9 carefully Skim 6.10


Mar 29 
Loop invariants. 6.(9 & 10) 
Pg 306: 6.10.(25). Due 11/13


Mar 31 
More on loop invariants. 6.(1011) 
Read 7 intro and 7.1 carefully Read 7.2 Skim 7.3 Practice exercises


Apr 3 
Function. Introduction. 7.(13) 
Pg 331: 7.2.(2&3) Pg 335: 7.3.(3, 4, 8) Read 7.4 Skim 7.5


Apr 5 
Images and inverse images. 7.(4 & 5) 
Pg 342: 7.4.(2, 5, 8, 9, 10) Read 7.(68)


Apr 7 
Map and filter. Function properties; inverse functions; composition. 7.(68) 
Pg 346: 7.6.(2, 3, 6) Pg 351: 7.8.(1, 5, 6) Programming problems Skim 7.9


Apr 10 
Cardinality. 7.9 
Pg 359: 7.9.(1 & 2)


Apr 12 
Nocredit quiz. Countability. 7.15 





Apr 21 
Map and foldl; modeling functions. 7.(5 & 14) 
Programming problems Read 7.12 carefully Skim 7.13




