warning about mu, some tweaks

[lambda.git] / exercises / assignment7.mdwn

diff --git a/exercises/assignment7.mdwn b/exercises/assignment7.mdwn
index ea387b9..bd614b3 100644 (file)
--- a/exercises/assignment7.mdwn
+++ b/exercises/assignment7.mdwn
@@ -42,8 +42,13 @@ Instead, we're going to give you almost the complete program, with a few gaps
 in it that you have to complete. You have to understand enough to
 add the last pieces to make the program function.
 
 in it that you have to complete. You have to understand enough to
 add the last pieces to make the program function.
 

-We're still writing up the (substantial) exposition of this, and will post a link
-to it here soon.
+You can find the skeleton code [[here|/code/untyped_evaluator.ml]].
+
+We've also prepared a much fuller version, that has user-friendly input
+and printing of results. We'll provide a link to that shortly. It
+will be easiest for you to understand that code if you've
+completed the gaps in the simplified skeleton linked above.
+

 
 ## Evaluation in the untyped lambda calculus: environments
 
 
 ## Evaluation in the untyped lambda calculus: environments
 


@@ -61,8 +66,8 @@ since it amounts to evaluating terms relative to an assignment
 function. The difference between the substitute-and-repeat approach
 above, and this approach, is one huge step towards monads.
 
 function. The difference between the substitute-and-repeat approach
 above, and this approach, is one huge step towards monads.
 

-We're still writing up the exposition of this, too, and will post a link
-to it here soon.
+The skeleton code for this is at the [[same link as before|/code/untyped_evaluator.ml]].
+This part of the exercise is the "V2" part of that code.

 
 
 ## Monads
 
 
 ## Monads