X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2F_assignment5.mdwn;h=c7ff959a2bae9b5a9284f897dcca011a6de1cd7a;hp=4383229ba821526810eeab752a325c53179a162a;hb=ee740cb01fb82eabad1dc1d044900b3f20731793;hpb=460926fde45d9719325a1fc0a4187e53e5cabb27

diff --git a/exercises/_assignment5.mdwn b/exercises/_assignment5.mdwn
index 4383229b..c7ff959a 100644
--- a/exercises/_assignment5.mdwn
+++ b/exercises/_assignment5.mdwn
@@ -497,15 +497,4 @@ and that `bool` is any boolean expression.  Then we can try the following:
 
     does not terminate.  Incidentally, using the shorter `match bool with true -> yes | false -> no` rather than the longer `let b = bool ... in match b with ...` *would* work as we desire. But your assignment is to control the evaluation order *without* using the special evaluation order properties of OCaml's native `if` or of its `match`. That is, you must keep the `let b = ... in match b with ...` structure in your answer, though you are allowed to adjust what `b`, `y`, and `n` get assigned to.
 
-    Here's a hint. (WHERE?)
-
-    <!-- Use thunks! (want more help?) -->
-
-    <!--
-    What does
-        let x = (fun () -> 2) in
-        let y = (fun () -> 3) in
-        match true with true -> x | false -> y
-    evaluate to?
-    -->
-
+    Here's a [[hint|assignment5 hint1]].