* 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 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
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.)
--->
-
## 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]].
+
+> Topics: More on Fixed Points; Sets; Aborting List Traversals; [[Implementing Trees]]
-<!-- Introducing the notion of a "continuation", which technique we'll now already have used a few times
--->
+
+(18 Oct) Lecture notes for [[Week5]] (in progress).
+
+> Topics: Types, Polymorphism
[[Upcoming topics]]
+[Advanced Lambda Calculus Topics](/advanced_lambda)
+
##[[Offsite Reading]]##
This wiki is powered by [[ikiwiki]].
-[[Test]]