we'll be doing the next week. It would be smart to make a serious start on that
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.
-
- 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
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.
+##[[Lambda Evaluator]]##
+
+Usable in your browser. It can help you check whether your answer to some of
+the homework questions works correctly.
+
+There is also now a [library](/lambda_library) of lambda-calculus
+arithmetical and list operations, some relatively advanced.
+
## Lecture Notes and Assignments ##
[Advanced Lambda Calculus Topics](/advanced_lambda)
+> Topics: Version 4 lists
+
+##Scheme and OCaml##
+
+See [below](#installing) for how to get the programming languages running on your computer.
+
+* Links for help [[learning Scheme]]
+
+* Links for help [[learning OCaml]]
+
##[[Offsite Reading]]##
familiar with one of them, it's not difficult to move between it and the
other.
+<a name=installing></a>
[[How to get the programming languages running on your computer]]
[[Family tree of functional programming languages]]
* *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).