X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment2.mdwn;h=8402e7ca8256e89d9ef332883782003bf2bc4c18;hp=f0e8a0989cfaf28919d7b03ead3ce51529a969e7;hb=a01e84adbe42b382dfd0b2d5496ba343855f712f;hpb=4c0fb46d0cb9dcbfa5687140afeca2fdb48f668c
diff --git a/assignment2.mdwn b/assignment2.mdwn
index f0e8a098..8402e7ca 100644
--- a/assignment2.mdwn
+++ b/assignment2.mdwn
@@ -38,28 +38,31 @@ Combinatory Logic
Reduce the following forms, if possible:
-1. Kxy
-2. KKxy
-3. KKKxy
-4. SKKxy
-5. SIII
-6. SII(SII)
-
-* Give Combinatory Logic combinators that behave like our boolean functions.
- You'll need combinators for true, false, neg, and, or, and xor.
+
+- `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:
-1. \x.x
-2. \xy.x
-3. \xy.y
-4. \xy.yx
-5. \x.xx
-6. \xyz.x(yz)
-
-* For each translation, how many I's are there? Give a rule for
+
+- `\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
-----------------