X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=assignment2.mdwn;h=5d75a855a5a09ef187dcdd9b6e4e22bb11b6ee7a;hb=8ad0a5c44c8193ce959dba87fa1f53b819dae178;hp=066f1b1f60b6863e8738e2604bd2d8748b53a7ed;hpb=3a5bbeb0ce1de37b0203e7c0efc2062608a9827c;p=lambda.git
diff --git a/assignment2.mdwn b/assignment2.mdwn
index 066f1b1f..5d75a855 100644
--- a/assignment2.mdwn
+++ b/assignment2.mdwn
@@ -1,3 +1,6 @@
+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
--------------------
@@ -30,6 +33,36 @@ Reduce to beta-normal forms:
`(\x y z. x z (y z)) (\u v. u)`
+Combinatory Logic
+-----------------
+
+Reduce the following forms, if possible:
+
+
+- `Kxy`
+
- `KKxy`
+
- `KKKxy`
+
- `SKKxy`
+
- `SIII`
+
- `SII(SII)`
+
+
- Give Combinatory Logic combinators that behave like our boolean functions.
+ You'll need combinators for `true`, `false`, `neg`, `and`, `or`, and `xor`.
+
+
+Using the mapping specified in the lecture notes,
+translate the following lambda terms into combinatory logic:
+
+
+- `\x.x`
+
- `\xy.x`
+
- `\xy.y`
+
- `\xy.yx`
+
- `\x.xx`
+
- `\xyz.x(yz)`
+
- For each translation, how many I's are there? Give a rule for
+ describing what each I corresponds to in the original lambda term.
+
Lists and Numbers
-----------------
@@ -74,7 +107,7 @@ For these exercises, assume that `LIST` is the result of evaluating:
-- What would be the result of evaluating (see [[Assignment 2 hint 1]] for a hint):
+
- What would be the result of evaluating (see [[hints/Assignment 2 hint]] for a hint):
LIST make-list empty