X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment4.mdwn;fp=assignment4.mdwn;h=cd89a134af191c0c53d2fc37e0001bb394d65548;hp=74238062bb73a517a0e6f350d9fbaa0089dfc383;hb=48b6ae024e8268541a5b6be4d87f4894e357e4a1;hpb=3fb01e0a2b4c4c0aae54138c336576ec803b474e

diff --git a/assignment4.mdwn b/assignment4.mdwn
index 74238062..cd89a134 100644
--- a/assignment4.mdwn
+++ b/assignment4.mdwn
@@ -1,15 +1,20 @@
 #Reversing a list#
 
-1.	How would you define an operation to reverse a list? (Don't peek at the
+<OL>
+<LI>How would you define an operation to reverse a list? (Don't peek at the
 [[lambda_library]]! Try to figure it out on your own.) Choose whichever
 implementation of list you like. Even then, there are various strategies you
 can use.
 
 (See [[hints/Assignment 4 hint 1]] if you need some hints.)
+</OL>
 
 
 #Comparing lists for equality#
 
+<OL start=2>
+<LI>blah
+</OL>
 <!--
 let list_equal =
     \left right. left
@@ -36,6 +41,9 @@ let list_equal =
 
 #Mutually-recursive functions#
 
+<OL start=3>
+<LI>blah
+</OL>
 
 
 #Enumerating the fringe of a leaf-labeled tree#
@@ -43,4 +51,7 @@ let list_equal =
 [[Implementing trees]]
 
 
+<OL start=4>
+<LI>blah
+</OL>