From f38560c70588aa58d7db41afb7904c2bd4638287 Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Wed, 15 Sep 2010 16:42:38 -0400
Subject: [PATCH] week1 tweaks

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---
 week1.mdwn | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/week1.mdwn b/week1.mdwn
index 6fadd1fa..27a79796 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -114,19 +114,19 @@ The lambda calculus we'll be focusing on for the first part of the course has no
 Here is its syntax:
 
 <blockquote>
-**Variables**: `x`, `y`, `z`, ...
+<strong>Variables</strong>: <code>x</code>, <code>y</code>, <code>z</code>...
 </blockquote>
 
 Each variable is an expression. For any expressions M and N and variable a, the following are also expressions:
 
 <blockquote>
-**Abstract**: <code>(&lambda;a M)</code>
+<strong>Abstract</strong>: <code>(&lambda;a M)</code>
 </blockquote>
 
 We'll tend to write <code>(&lambda;a M)</code> as just `( \a M )`.
 
 <blockquote>
-**Application**: `(M N)`
+<strong>Application</strong>: <code>(M N)</code>
 </blockquote>
 
 Some authors reserve the term "term" for just variables and abstracts. We won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
-- 
2.11.0