X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week9.mdwn;h=21a64c53ff279e688a5014354af960f1018d9c83;hp=2b80483989efca1fd91845b1a022eee173b2ee36;hb=ef2690fcfff802caf4ecfd437b94bed83acaf511;hpb=40b5ff7bf5c1f0fe0843ca938af8ced1ec5c9976

diff --git a/week9.mdwn b/week9.mdwn
index 2b804839..21a64c53 100644
--- a/week9.mdwn
+++ b/week9.mdwn
@@ -389,7 +389,7 @@ This brings up an interesting conceptual distinction. Formerly, we'd naturally t
 
 To handle implicit-style mutation, we'll need to re-implement the way we interpret expressions like `x` and `let x = expr1 in expr2`. We will also have just one new syntactic form, `change x to expr1 then expr2`.
 
-Here's how to implement these. We'll suppose that our assignment function is list of pairs, as in [week7](/reader_monad_for_variable_binding).
+Here's how to implement these. We'll suppose that our assignment function is list of pairs, as above and as in [week7](/reader_monad_for_variable_binding).
 
 	let rec eval expression g s =
 		match expression with