Date		Topic	Notes	Homework
T	Jan   13	Reduction semantics	Redex I.1	Ex. I.1.1-5
Th	15	Induction	Appendix 20	Ex. 20.1-3, 20.6
T	20	Consistency; lambda calculus	Redex I.2; I.3.1-2	Ex. I.3.4-5
Th	22	Lambda calculus encodings	Redex I.3.3-6	Ex. I.3.{7,8,12,13}
T	27	Recursion and normal forms	Redex I.3.7-10	Ex. I.3.16-17
Th	29	Redex	Redex II.1	Ex. II.1.2-5
T	Feb  3	ISWIM	Redex I.4	Ex. I.4.{1,2,9}
Th	5	Standard Reduction	Redex I.5	Ex. I.5.1-4
T	10	Variables and meta-functions	Redex II.2	II-2
Th	12	CC, SCC	Redex I.6.1-2	I-6.1-2
T	17	CK, CEK	Redex I.6.3-5	I-6.3-4
Th	19	Tail calls and space	Redex I.7	Ex. I.7.2-3
T	24	Errors	Redex I.8.1-2	Ex. I.8.{1,7,9}
Th	26	Class canceled
T	Mar  3	Exceptions	Redex I.8.3; II.3	I-8.3
Th	5	Continuations	Redex I.8.4	I-8.3-4
T	10	State	Redex I.9.1-3	Ex. I.9.{1,4,5,7}
Th	12	CESK, GC	Redex I.9.4-5	mid-term
T	17	Spring break
Th	19	Spring break
T	24	Types	PLLC 12	Ex. 12.{1,6}
Th	26	Simply Typed ISWIM	PLLC 13	13
T	31	Pairs, Variants, Recursion	PLLC 14	Ex. 14.1-4
Th	Apr  2	Polymorphism	PLLC 15	Ex. 15.1-2
T	7	Type inferrence	PLLC 16	Ex. 16.1-2
Th	9	Recursive types	PLLC 17	Ex. 17.1-3
T	14	Existential types	PLLC 18	Ex. 18.1
Th	16	Subtypes	PLLC 19	Ex. 19.1
T	21	Classes	PLLC 20	Ex. 20.2-4
Th	23	Class canceled
T	28	Denotational semantics	denote, domains	take-home final due