X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2Fweek2_lambda_intro.mdwn;h=4b0917529eb8041f64e6e43f42de0c2cad17de54;hp=d002abf8da0287a592c2286749f95f22a2326ab6;hb=020566910974049e4cd9cbc9279a781768e1817c;hpb=ddafcdc11f354d8ce4be628b006316c57083d1ec

diff --git a/topics/week2_lambda_intro.mdwn b/topics/week2_lambda_intro.mdwn
index d002abf8..4b091752 100644
--- a/topics/week2_lambda_intro.mdwn
+++ b/topics/week2_lambda_intro.mdwn
@@ -317,7 +317,7 @@ are distinct lambda expressions:
 
     (\z z)
 
-yet when applied to any argument M, all of these will always return M. So they
+yet when applied to any argument `M`, all of these will always return `M`. So they
 have the same extension. It's also true, though you may not yet be in a
 position to see, that no other function can differentiate between them when
 they're supplied as an argument to it. However, these expressions are all
@@ -437,7 +437,7 @@ expressions to assign values to variables.  For instance,
     let x match 2
     in (x, x) 
 
-evaluates to the ordered pair (2, 2).  It may be helpful to think of
+evaluates to the ordered pair `(2, 2)`.  It may be helpful to think of
 a redex in the lambda calculus as a particular sort of `let`
 construction.