> We posted [[answers to Week 1's homework|exercises/assignment1_answers]].
(**Week 3**) Thursday 12 February 2015
-*We will continue to develop these notes over the next few days.*
> Topics:
[[Arithmetic with Church numbers|topics/week3_church_arithmetic]];
-[[More on Lists|topics/week3 lists]] (expanded on Sunday);
+[[More on Lists|topics/week3 lists]];
[[What is computation?|topics/week3_what_is_computation]];
-[[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb);
-[[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday);
-[[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday);
+[[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]];
+[[Unit and its usefulness|topics/week3 unit]];
+[[Combinatory Logic|topics/week3 combinatory logic]];
[[Homework|exercises/assignment3]]
> Also, by this point you should be able to handle all of *The Little Schemer* except for Chapters 9 and 10. Chapter 9 covers what is going on under the hood with `letrec`, and that will be our topic for next week. You can also read Chapter 4 of Hankin on Combinatory Logic.
> We posted [[answers to Week 3's homework|exercises/assignment3_answers]].
(**Week 5**) Thursday 26 February 2015
-
-> *Note*: Jim will be updating and expanding the lecture notes by Tuesday, but doesn't want to delay any longer letting you have access to the drafts we (in part) presented from in seminar. But do come back and re-read the pages when the expanded versions are posted.
-
> Topics:
[[Simply-typed lambda calculus|topics/week5 simply typed]];
[[System F|topics/week5 system F]];
-Types in OCaml and Haskell;
-Practical advice for working with OCaml and/or Haskell (all will be posted soon);
+Types in OCaml and Haskell (will be posted someday);
+Practical advice for working with OCaml and/or Haskell (will be posted someday);
[[Homework|exercises/assignment5]]
> *There is some assigned reading for our next meeting.* This comes in two batches. The first batch consists of [[this footnote|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives*. Also recommended, but not mandatory, is [[this selection|readings/king-on-schiffer.pdf]] from Chapter 4 of Jeff King's 2007 book *The Nature and Structure of Content*. The second batch consists of [[this paper|readings/rieppel-beingsthg.pdf]] from Michael Rieppel, a recent Berkeley Philosophy PhD, on Frege's "concept horse" problem. Also recommended, but not mandatory, is [[this selection|readings/king-on-logicism.pdf]] from Chapter 5 of King's book. (It reviews and elaborates his paper "[Designating propositions](http://philpapers.org/rec/KINDP)".)
(**Week 7**) Thursday March 12
-> Topics: [[Combinatory evaluator|topics/week7_combinatory_evaluator]]; Interpreter for Lambda terms; [[Introducing Monads|topics/week7_introducing_monads]]; [[Homework|exercises/assignment7]]
+> *Many of these were updated or first posted on Mon 23 March.*
+
+> Topics: [[Combinatory evaluator|topics/week7_combinatory_evaluator]]; [[Introducing Monads|topics/week7_introducing_monads]]; [[Homework|exercises/assignment7]]; [[Environments and Closures|topics/week7_environments_and_closures]]; [[Untyped lambda evaluator|topics/week7_untyped_evaluator]]
+
+> We posted answers to [[Week 4's homework|exercises/assignment4_answers]] and [[Week 5-6's homework|exercises/assignment5_answers]].
+
-<!--
(**Week 8**) Thursday March 26
--->
+> Topics: [[Safe division with monads|topics/week8_safe_division_with_monads]]; [[Long but useful ramble|topics/week8_ramble]]
+
+(**Week 9**) Thursday April 2
+> Topics: [[Installing and using the OCaml Juli8 library|/juli8]]; [[Using the OCaml Monad library|/topics/week9_using_the_monad_library]]; the State monad; Programming with mutable state; Using multiple monads together
+
<!--
We've added a [[Monad Library]] for OCaml.