(no commit message)

[lambda.git] / assignment1.mdwn

diff --git a/assignment1.mdwn b/assignment1.mdwn
index 430f3c8..6fd29ee 100644 (file)
--- a/assignment1.mdwn
+++ b/assignment1.mdwn
@@ -1,4 +1,4 @@
-*Reduction*
+**Reduction**
 
 Find "normal forms" for the following (that is, reduce them as far as it's possible to reduce 
 them):
@@ -12,7 +12,7 @@ them):
     7. (\x (x x x)) (\x (x x x))
 
 
-*Booleans*
+**Booleans**
 
 Recall our definitions of true and false.
 
@@ -26,7 +26,7 @@ In Racket, these can be defined like this:
 
 
 8. Define a "neg" operator that negates "true" and "false".
-Expeceted behavior: (((neg true) 10) 20) evaluates to 20,
+Expected behavior: (((neg true) 10) 20) evaluates to 20,
 (((neg false) 10) 20) evaluates to 10.
 
 9. Define an "and" operator.
@@ -44,6 +44,7 @@ one of those values, call it a black-or-white-value, we should be able to
 write:
 
        the-black-or-white-value if-black if-white
+
 (where if-black and if-white are anything), and get back one of if-black or
 if-white, depending on which of the black-or-white values we started with. Give
 a definition for each of "black" and "white". (Do it in both lambda calculus