more2 assignment1 tweaks

[lambda.git] / assignment1.mdwn

diff --git a/assignment1.mdwn b/assignment1.mdwn
index 9bb65b3..7568717 100644 (file)
--- a/assignment1.mdwn
+++ b/assignment1.mdwn
@@ -1,7 +1,7 @@
 Reduction
 ---------
 
-Find "normal forms" for the following---that is, reduce them until no more reductions are possible. We'll write λ`x` as `\x`.
+Find "normal forms" for the following---that is, reduce them until no more reductions are possible. We'll write <code>&lambda;x</code> as `\x`.
 
 1. `(\x \y. y x) z`
 2. `(\x (x x)) z`
@@ -17,8 +17,8 @@ Booleans
 
 Recall our definitions of true and false.
 
->   "true" defined to be `\t \f. t`
->   "false" defined to be `\t \f. f`
+>   `true` defined to be `\t \f. t`  
+>   `false` defined to be `\t \f. f`
 
 In Racket, these can be defined like this:
 
@@ -26,7 +26,7 @@ In Racket, these can be defined like this:
        (define false (lambda (t) (lambda (f) f)))
 
 <OL start=8>
-<LI>Define a "neg" operator that negates "true" and "false".
+<LI>Define a `neg` operator that negates `true` and `false`.
 
 Expected behavior: 
 
@@ -38,9 +38,9 @@ evaluates to 20, and
 
 evaluates to 10.
 
-<LI>Define an "and" operator.
+<LI>Define an `and` operator.
 
-<LI>Define an "xor" operator. 
+<LI>Define an `xor` operator. 
 
 (If you haven't seen this term before, here's a truth table: