ass5: tweaks

[lambda.git] / assignment5.mdwn

diff --git a/assignment5.mdwn b/assignment5.mdwn
index d73dc0e..a79df5f 100644 (file)
--- 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: