* The seminar meets on Mondays from 4-6, in
the Linguistics building at 10 Washington Place, in room 104 (back of the first floor).
-<font color=red>
-
* One student session will be held every Wednesday from 3-4. The other will
be arranged to fit the schedule of those who'd like to attend but can't
make the Wednesday time. (We first proposed Tuesdays from 11-12, but this
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 on Monday Oct 11.)
+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
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.
-</font>
-
-<!--
- 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.)
--->
-
+##[[Lambda Evaluator]]##
## Lecture Notes and Assignments ##
an evaluator with the definitions used for homework 3
preloaded is available at [[assignment 3 evaluator]].
-> Topics: Recursion with Fixed Point Combinators; [[Evaluation Order]]
+> Topics: [[Evaluation Order]]; Recursion with Fixed Point Combinators
-(4 Oct) Lecture notes for [[Week4]]; Assignment4
+(4 Oct) Lecture notes for [[Week4]]; [[Assignment4]].
> Topics: More on Fixed Points; Sets; Aborting List Traversals; [[Implementing Trees]]
-(18 Oct) Lecture notes for Week 5
+(18 Oct) Lecture notes for [[Week5]] (in progress).
> Topics: Types, Polymorphism
[[Upcoming topics]]
-[Advanced Lambda Calculus Topics](/advanced lambda)
+[Advanced Lambda Calculus Topics](/advanced_lambda)
##[[Offsite Reading]]##
* *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).