X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=topics%2Fweek7_introducing_monads.mdwn;h=f5387f39a480b644dd20c904440dddf8ac604cb8;hb=097ba8c44d6499dffc216492f3b76c47396838ab;hp=7dbb55fc906b52abc8c58efd18b7c11b9f85235b;hpb=2560da9245de9d85d19d4513fd3ac6100c8c4225;p=lambda.git

diff --git a/topics/week7_introducing_monads.mdwn b/topics/week7_introducing_monads.mdwn
index 7dbb55fc..f5387f39 100644
--- a/topics/week7_introducing_monads.mdwn
+++ b/topics/week7_introducing_monads.mdwn
@@ -53,7 +53,7 @@ to specify which one of them the box is capturing. But let's keep it simple.) So
     (α, α) tree
 
 The idea is that whatever type the free type variable `α` might be instantiated to,
-we will be a "type box" of a certain sort that "contains" values of type `α`. For instance,
+we will have a "type box" of a certain sort that "contains" values of type `α`. For instance,
 if `α list` is our box type, and `α` is the type `int`, then in this context, `int list`
 is the type of a boxed integer.