X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment2.mdwn;h=5d75a855a5a09ef187dcdd9b6e4e22bb11b6ee7a;hp=85ec6ce71385d856231a482a0bdc74a4aaaa1e16;hb=0cd006d378ff7e001b4bc5203c97771eafd209da;hpb=70fdac4d0a4db28dc391e3ea13b9c590b6ef9760

diff --git a/assignment2.mdwn b/assignment2.mdwn
index 85ec6ce7..5d75a855 100644
--- a/assignment2.mdwn
+++ b/assignment2.mdwn
@@ -1,4 +1,4 @@
-For these assignments, you'll probably want to use a "lambda calculator" to check your work. This accepts any grammatical lambda expression and reduces it to normal form, when possible. See the page on [[using the programming languages]] for instructions and links about setting this up.
+For these assignments, you'll probably want to use our [[lambda evaluator]] to check your work. This accepts any grammatical lambda expression and reduces it to normal form, when possible.
 
 
 More Lambda Practice
@@ -53,7 +53,7 @@ Reduce the following forms, if possible:
 Using the mapping specified in the lecture notes,
 translate the following lambda terms into combinatory logic:
 
-<OL start=24>
+<OL start=23>
 <LI> `\x.x`
 <LI> `\xy.x`
 <LI> `\xy.y`
@@ -107,7 +107,7 @@ For these exercises, assume that `LIST` is the result of evaluating:
 
 
 <OL start=16>
-<LI>What would be the result of evaluating (see [[Assignment 2 hint 1]] for a hint):
+<LI>What would be the result of evaluating (see [[hints/Assignment 2 hint]] for a hint):
 
 	LIST make-list empty