X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week2.mdwn;h=95b1bb9807521fa8d2b7d9fa1e655009870ee3fd;hp=ebc595933b3da7193324696ead70c88191e8f9d1;hb=fdc741933683621ccad260cf9b8c985d234f48f3;hpb=08a3dd2c1b83fb8e5b31be0895a9d257cc915446;ds=sidebyside

diff --git a/week2.mdwn b/week2.mdwn
index ebc59593..95b1bb98 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -35,9 +35,10 @@ Another way to think of it is to identify expressions not with particular alphab
 
 A third way to think is to identify the lambda formula not with classes of alphabetic sequences, but rather with abstract structures that we might draw like this:
 
-<pre><code>&lambda; ... `___` ...
+<pre><code>&lambda;
+	... ___ ...
 ^      |
-|`______`|
+|______|
 </code></pre>
 
 Here there are no bound variables, but there are *bound positions*. We can regard formula like (a) and (b) as just helpfully readable ways to designate these abstract structures.