X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=88b02615dd14901b242a3f00e935a0fc98a97c94;hp=c4f7dc6315a0d9e53505693b40356c992138efe2;hb=6040c9a08f6e2a772d14333c19e006b4e173ca0b;hpb=fbd9eedd63bd8bd3bede53ed6c5f4dbef896d815

diff --git a/index.mdwn b/index.mdwn
index c4f7dc63..88b02615 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -23,11 +23,14 @@ week's homework, for instance, before the session.
 
 *	There is now a [[lambda evaluator]] you can use in your browser (no need to
 install any software). It can help you check whether your answer to some of the
-homework questions works correctly.
+homework questions works correctly.  
 
 	There is also now a [library](/lambda_library) of lambda-calculus
 arithmetical and list operations, some relatively advanced.
 
+	An evaluator with the definitions used for homework 3
+preloaded is available at [[assignment 3 evaluator]]. 
+
 *	Henceforth, unless we say otherwise, every homework will be "due" by
 Sunday morning after the Monday seminar in which we refer to it.
 (Usually we'll post the assignment shortly before the seminar, but don't
@@ -46,15 +49,7 @@ explain your solutions in conversations at any point, in section or in
 class.
 
 	You should always *aim* to complete the assignments by the "due" date,
-as this will fit best with the progress of the seminar. Let's take
-assignment 3 to be "due" on Sunday Oct 3 (the date of this
-announcement), but as we announced last week in seminar, you can take up
-until this coming Sunday to complete it. If you need to. Try to complete
-it, and get assistance completing it if you need it, sooner.
-
-*	We'll shortly be posting another assignment, assignment 4, which will be
-"due" on the Sunday before our next seminar. That is, on Sunday Oct 17.
-(There's no seminar this coming Monday.)
+as this will fit best with the progress of the seminar.
 
 	The assignments will tend to be quite challenging. Again, you should by
 all means talk amongst yourselves, and to us, about strategies and
@@ -68,36 +63,35 @@ what is difficult, what you tried, why what you tried didn't work, and
 what you think you need in order to solve the problem.
 
 
-<!--
-  To play around with a **typed lambda calculus**, which we'll look at later
-  in the course, have a look at the [Penn Lambda Calculator](http://www.ling.upenn.edu/lambda/).
-  This requires installing Java, but provides a number of tools for evaluating
-  lambda expressions and other linguistic forms. (Mac users will most likely
-  already have Java installed.)
--->
-
-
 ## Lecture Notes and Assignments ##
 
 (13 Sept) Lecture notes for [[Week1]]; [[Assignment1]].
 
-Topics: Applications; Basics of Lambda Calculus; Comparing Different Languages
+>	Topics: [[Applications]], including [[Damn]]; Basics of Lambda Calculus; Comparing Different Languages
 
 (20 Sept) Lecture notes for [[Week2]]; [[Assignment2]].
 
-Topics: Reduction and Convertibility; Combinators; Evaluation Strategies and Normalization; Decidability; Lists and Numbers
+>	Topics: Reduction and Convertibility; Combinators; Evaluation Strategies and Normalization; Decidability; [[Lists and Numbers]]
 
-(27 Sept) Lecture notes for [[Week3]];  [[Assignment3]].
+(27 Sept) Lecture notes for [[Week3]];  [[Assignment3]];
+an evaluator with the definitions used for homework 3
+preloaded is available at [[assignment 3 evaluator]]. 
 
-Topics: Recursion with Fixed Point Combinators
+>	Topics: [[Evaluation Order]]; Recursion with Fixed Point Combinators
 
-(4 Oct) Lecture notes for Week 4
+(4 Oct) Lecture notes for [[Week4]]; [[Assignment4]].
 
-<!-- Introducing the notion of a "continuation", which technique we'll now already have used a few times
--->
+>	Topics: More on Fixed Points; Sets; Aborting List Traversals; [[Implementing Trees]] 
+
+
+(18 Oct) Lecture notes for [[Week5]] (in progress).
+
+>	Topics: Types, Polymorphism
 
 [[Upcoming topics]]
 
+[Advanced Lambda Calculus Topics](/advanced_lambda)
+
 
 ##[[Offsite Reading]]##
 
@@ -243,15 +237,16 @@ It's not necessary to purchase these for the class. But they are good ways to ge
 
 *	*An Introduction to Lambda Calculi for Computer Scientists*, by Chris
 Hankin, currently $17 on
-[Amazon](http://www.amazon.com/Introduction-Lambda-Calculi-Computer-Scientists/dp/0954300653).
+[Amazon](http://www.amazon.com/dp/0954300653).
 
 *	(Another good book covering the same ground as the Hankin book, but
 more thoroughly, and in a more mathematical style, is *Lambda-Calculus and Combinators:
-an Introduction*, by J. Roger Hindley and Jonathan P. Seldin. If you choose to read
+an Introduction*, by J. Roger Hindley and Jonathan P. Seldin, currently $52 on [Amazon](http://www.amazon.com/dp/0521898854). If you choose to read
 both the Hankin book and this book, you'll notice the authors made some different
 terminological/notational choices. At first, this makes comprehension slightly slower,
 but in the long run it's helpful because it makes the arbitrariness of those choices more salient.)
 
+*	(Another good book, covering some of the same ground as the previous two, but also delving much deeper into typed lambda calculi, is *Types and Programming Languages*, by Benjamin Pierce, currently $61 on [Amazon](http://www.amazon.com/dp/0262162091). This book has many examples in OCaml.)
 
 *   *The Little Schemer, Fourth Edition*, by Daniel P. Friedman and Matthias
 Felleisen, currently $23 on [Amazon](http://www.amazon.com/exec/obidos/ASIN/0262560992).
@@ -280,5 +275,4 @@ All wikis are supposed to have a [[SandBox]], so this one does too.
 
 This wiki is powered by [[ikiwiki]].
 
-[[Test]]