X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=monad_transformers.mdwn;h=26fb13ff9fc47e5f0969e0e41d4ce52bbbf03c3d;hp=f6de5308baabcbf940ae59ff6f0174ae8471f66f;hb=3a24f457b5d8dfe280e95913d3b13d65f31b6fe8;hpb=8cd7f357e9a9d71795ec62eab0adb720f67d9011

diff --git a/monad_transformers.mdwn b/monad_transformers.mdwn
index f6de5308..26fb13ff 100644
--- a/monad_transformers.mdwn
+++ b/monad_transformers.mdwn
@@ -467,7 +467,7 @@ The meaning of `shift` will be explained in [[CPS and Continuation Operators]].
 
 	TreeCont.monadize (fun a -> fun k -> k (a*a)) t1 (fun t -> t);;
 
-But because of the way our monad library hides the underlying machinery, you can't just say `fun k -> k (a*a)`, you have to say `shift (fun k -> k (a*a))`.
+But because of the way our monad library hides the underlying machinery, here you can no longer just say `fun k -> k (a*a)`; you have to say `shift (fun k -> k (a*a))`.
 
 Moving on, we can count the leaves:
 <!--