tweaked week3

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

diff --git a/week3.mdwn b/week3.mdwn
index 1f1b632..f5f075a 100644 (file)
--- a/week3.mdwn
+++ b/week3.mdwn
@@ -2,8 +2,9 @@
 
 How could we compute the length of a list? Without worrying yet about what lambda-calculus implementation we're using for the list, the basic idea would be to define this recursively:
 
 
 How could we compute the length of a list? Without worrying yet about what lambda-calculus implementation we're using for the list, the basic idea would be to define this recursively:
 

-       the empty list has length 0
-       any non-empty list has length 1 + (the length of its tail)
+>      the empty list has length 0
+
+>      any non-empty list has length 1 + (the length of its tail)

 
 In OCaml, you'd define that like this:
 
 
 In OCaml, you'd define that like this: