X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment5.mdwn;h=f402ec61a70bbe9ebe4e5f7c2f4a2f1ecc853ede;hp=b1f65d2a0394fc1e637958f75b67237f13264ec5;hb=2d5df0441175013c782ebee648a17043405ca251;hpb=93d67277339f0aed8184a14bbc35ec5060a0c031
diff --git a/assignment5.mdwn b/assignment5.mdwn
index b1f65d2a..f402ec61 100644
--- a/assignment5.mdwn
+++ b/assignment5.mdwn
@@ -121,7 +121,7 @@ and that "bool" is any boolean. Then we can try the following:
or of `match`. That is, you must keep the `let` statements, though
you're allowed to adjust what `b`, `y`, and `n` get assigned to.
- [[Hint assignment 5 problem 3]]
+ [[hints/assignment 5 hint 1]]
Booleans, Church numerals, and v3 lists in OCaml
------------------------------------------------
@@ -233,8 +233,8 @@ any auxiliary functions you need.
Baby monads
-----------
-Read the material on dividing by zero/towards monads from the end of lecture
-notes for week 6, then write a function `lift'` that generalized the
+Read the material on dividing by zero/towards monads from ~~the end of lecture
+notes for week 6~~ the start of lecture notes for week 7, then write a function `lift'` that generalized the
correspondence between + and `add'`: that is, `lift'` takes any two-place
operation on integers and returns a version that takes arguments of type `int
option` instead, returning a result of `int option`. In other words, `lift'`