From: jim Date: Sun, 8 Mar 2015 02:11:48 +0000 (-0500) Subject: renumber hint again X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=d7b2ba7d870cccd91313e5d32a6c195ee5140dcd renumber hint again --- diff --git a/exercises/assignment5.mdwn b/exercises/assignment5.mdwn index f0ee4811..f4955d9d 100644 --- a/exercises/assignment5.mdwn +++ b/exercises/assignment5.mdwn @@ -384,7 +384,7 @@ Yet we haven't given ourselves the capacity to talk about `list [S]` and so on a = λf:T -> S. λxs:list. xs [T] [list [S]] (λx:T. λys:list [S]. cons [S] (f x) ys) (nil [S]) --> -*Update: Never mind, don't bother with the next three questions. They proved to be more difficult to implement in OCaml than we expected. Here is [[some explanation|assignment5 hint3]].* +*Update: Never mind, don't bother with the next three questions. They proved to be more difficult to implement in OCaml than we expected. Here is [[some explanation|assignment5 hint4]].* 19. Convert this list encoding and the `map` function to OCaml or Haskell. Again, call the type `sysf_list`, and the functions `sysf_nil`, `sysf_cons`, and `sysf_map`, to avoid collision with the names for native lists and functions in these languages. (In OCaml and Haskell you *can* say `('t) sysf_list` or `Sysf_list t`.)