X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=dbb8a4bded9c73e91f72f340c67e81dfc7f87d3c;hp=3054b9c22f9b5978cc504df8c1d03fd5cb20c58b;hb=96a8c8c9b81fc914ac7ec368fab0ffa4bcf4177a;hpb=5d1fba11f467690102612a059363e8b77eccfe32 diff --git a/index.mdwn b/index.mdwn index 3054b9c2..dbb8a4bd 100644 --- a/index.mdwn +++ b/index.mdwn @@ -10,8 +10,6 @@ This course will be co-taught by [Chris Barker](http://homepages.nyu.edu/~cb125/ * The seminar meets on Mondays from 4-6, 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 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 @@ -23,16 +21,6 @@ issues from material we've discussed, and help get a better footing for what 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 @@ -51,15 +39,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 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 @@ -72,15 +52,13 @@ very much worthwhile (and very much appreciated) if you would explain 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 ## @@ -97,20 +75,28 @@ what you think you need in order to solve the problem. 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 Week 4 +(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) + +##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]]## @@ -246,6 +232,7 @@ 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]] [[Family tree of functional programming languages]] @@ -257,15 +244,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).