XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=1d090eb60ebb388cb0e638064f5018ee20ed933f;hp=d28e4f98151812e65dd4f8e55ce19c369a645910;hb=9efbe94f74c2ea61522fcdb3e3d012fde6034fcd;hpb=f5e709ab995a33435e3aa650f96ecedbdbbb2fad;ds=sidebyside
diff git a/index.mdwn b/index.mdwn
index d28e4f98..1d090eb6 100644
 a/index.mdwn
+++ b/index.mdwn
@@ 2,25 +2,101 @@
or: **What Philosophers and Linguists Can Learn From Theoretical Computer Science But Didn't Know To Ask**
This course will be cotaught by [Chris Barker](http://homepages.nyu.edu/~cb125/) and [Jim Pryor](http://www.jimpryor.net/). Linguistics calls it "G61.3340002" and Philosophy calls it "G83.2296001."

+This course is cotaught by [Chris Barker](http://homepages.nyu.edu/~cb125/) and [Jim Pryor](http://www.jimpryor.net/). Linguistics calls it "G61.3340002" and Philosophy calls it "G83.2296001."
+The seminar meets on Mondays from 46, in
+the Linguistics building at 10 Washington Place, in room 104 (back of the first floor).
+One student session will be held every Wednesday from 34 on the
+fourth floor at 10 Washington Place.
## Announcements ##
The seminar meets on Mondays from 46, in
the Linguistics building at 10 Washington Place, in room 104 (back of the first floor).
+* This is the time of the semester when some people start slipping
+ behind with the homework. Don't.
+
+[[Older Announcements]]
+
+##[[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 lambdacalculus
+arithmetical and list operations, some relatively advanced.
+
+
+## Lecture Notes and Assignments ##
+
+(13 Sept) Lecture notes for [[Week1]]; [[Assignment1]].
+
+> 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]]
+
+(27 Sept) Lecture notes for [[Week3]]; [[Assignment3]];
+an evaluator with the definitions used for homework 3
+preloaded is available at [[assignment 3 evaluator]].
+
+> Topics: [[Evaluation Order]]; Recursion with Fixed Point Combinators
+
+(4 Oct) Lecture notes for [[Week4]]; [[Assignment4]].
+
+> Topics: More on Fixed Points; Sets; Aborting List Traversals; [[Implementing Trees]]
+
+
+(18 Oct, 25 Oct) Lecture notes for [[Week5]] and [[Week6]]; [[Assignment5]].
+
+> Topics: Types, Polymorphism, Unit and Bottom
+
+(1 Nov) Lecture notes for [[Week7]]; [[Assignment6]].
+
+> Topics: Monads; [[Reader Monad for Variable Binding]]; [[Reader Monad for Intensionality]]
+
+(8 Nov) Lecture notes for [[Week8]].
+
+> Topics: Reader Monad for Jacobson's VariableFree Semantics
+
+(15 Nov) Lecture notes for [[Week9]]; [[Assignment7]]. Everyone auditing in the class is encouraged to do this assignment, or at least work through the substantial "hints".
We've sent around an email to those who left their email addresses on the roster we passed around. But it's clear that the roster didn't make its way to everyone. So if you didn't receive our email this evening, please email with your email address, and if you're a student, say whether you expect to audit or take the class for credit.
+> Topics: Mutable Variables; Passing by Reference
All students are invited to help us schedule, and then participate in, a regular student session in addition to the Monday seminar meetings. If you didn't receive our email about this, go to
 as soon as you can and please tell us when you're available.
+(22 Nov) Lecture notes for [[Week10]]
## Assignments ##
+> Topics: Calculator Improvements, including mutation
[[Assignment1]]
+(30 Nov) Lecture notes for [[Week11]]; [[Assignment8]].
+> Topics: [[Tree and List Zippers]]; [[Coroutines and Aborts]]; [[From List Zippers to Continuations]].
## Overview ##
+(6 Dec) Lecture notes for [[Week12]]
+
+> Topics: [[List Monad as Continuation Monad]]; [[Manipulating Trees with Monads]]; ...
+
+(13 Dec) Lecture notes for Week13
+
+[[Upcoming topics]]
+
+[[Advanced Topics]]
+
+> Topics: Version 4 lists, Monads in Category Theory, Calculator Improvements
+
+##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]]##
+
+There's lots of links here already to tutorials and encyclopedia entries about many of the notions we'll be dealing with.
+
+
+
+## Course Overview ##
The goal of this seminar is to introduce concepts and techniques from
theoretical computer science and show how they can provide insight
@@ 147,27 +223,28 @@ other. But these languages also have a lot in common, and if you're
familiar with one of them, it's not difficult to move between it and the
other.
+
[[How to get the programming languages running on your computer]]
[[Using the programming languages]]

[[Family tree of functional programming languages]]
+
## Recommended Books ##
It's not necessary to purchase these for the class. But they are good ways to get a more thorough and solid understanding of some of the more basic conceptual tools we'll be using.
* *An Introduction to Lambda Calculi for Computer Scientists*, by Chris
Hankin, currently $17 on
[Amazon](http://www.amazon.com/IntroductionLambdaCalculiComputerScientists/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 *LambdaCalculus 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).
@@ 188,13 +265,6 @@ this time in ML. It uses another dialect of ML (called SML), instead of OCaml, b
superficial syntactic differences between these languages. [Here's a translation
manual between them](http://www.mpisws.org/~rossberg/smlvsocaml.html).
##[[Schedule of Topics]]##

##[[Lecture Notes]]##

##[[Offsite Reading]]##

There's lots of links here already to tutorials and encyclopedia entries about many of the notions we'll be dealing with.

@@ 202,3 +272,5 @@ There's lots of links here already to tutorials and encyclopedia entries about m
All wikis are supposed to have a [[SandBox]], so this one does too.
This wiki is powered by [[ikiwiki]].
+
+