From: Jim Pryor <profjim@jimpryor.net>
Date: Wed, 15 Sep 2010 21:22:41 +0000 (-0400)
Subject: week1 tweaks
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=c3090923f3269f73dd67893d6d68be1c890a5bc7

week1 tweaks

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

diff --git a/week1.mdwn b/week1.mdwn
index c68da8a0..788e8276 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -281,14 +281,14 @@ Lambda terms represent functions
 All (recursively computable) functions can be represented by lambda
 terms (the untyped lambda calculus is Turing complete). For some lambda terms, it is easy to see what function they represent:
 
-(\x x) represents the identity function: given any argument M, this function
-simply returns M: ((\x x) M) ~~> M.
+>	`(\x x)` represents the identity function: given any argument `M`, this function
+simply returns `M`: `((\x x) M) ~~> M`.
 
-(\x (x x)) duplicates its argument:
-((\x (x x)) M) ~~> (M M)
+>	`(\x (x x))` duplicates its argument:
+`((\x (x x)) M) ~~> (M M)`
 
-(\x (\y x)) throws away its second argument:
-(((\x (\y x)) M) N) ~~> M
+>	`(\x (\y x))` throws away its second argument:
+`(((\x (\y x)) M) N) ~~> M`
 
 and so on.