From: Jim Pryor Date: Tue, 26 Oct 2010 14:49:31 +0000 (-0400) Subject: ass5: tweaks X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=97c9b87441ad9522778a2da6be93d9c73c8149a8 ass5: tweaks Signed-off-by: Jim Pryor --- 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: