X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment5.mdwn;fp=assignment5.mdwn;h=a79df5f70222902010fe6dd1b65482b44a434a8a;hp=d73dc0e5a76d614e96fbce501efe1858a07a5ad3;hb=97c9b87441ad9522778a2da6be93d9c73c8149a8;hpb=e5df41e2c68e8b17d208a3c9bb3c4c8d8cfbf34e

diff --git a/assignment5.mdwn b/assignment5.mdwn
index d73dc0e5..a79df5f7 100644
--- a/assignment5.mdwn
+++ b/assignment5.mdwn
@@ -185,7 +185,7 @@ We can write functions like map:
 		= λf :σ → τ. λl:σ list. l [τ list] nilτ (λx:σ. λy:τ list. consτ (f x) y
 
 **Excercise** convert this function to OCaml.  Also write an `append` function.
-Also write a **head** function. Test with simple lists.
+Also write a **head** function. Also write nil??? Test with simple lists.
 
 
 Consider the following simple binary tree type: