X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=manipulating_trees_with_monads.mdwn;h=47fa6f0da08ad5fafebd6f3fec494152a705a175;hp=73174fd0683343de73a320532867c5fd06228d59;hb=f719b082e2cfe4249565a8fb189e983731ada27f;hpb=9544a91e8b91d45196c976caa82be78fad92b832

diff --git a/manipulating_trees_with_monads.mdwn b/manipulating_trees_with_monads.mdwn
index 73174fd0..47fa6f0d 100644
--- a/manipulating_trees_with_monads.mdwn
+++ b/manipulating_trees_with_monads.mdwn
@@ -329,7 +329,7 @@ In a moment, we'll return to the same-fringe problem.  Since the
 simple but inefficient way to solve it is to map each tree to a list
 of its leaves, this transformation is on the path to a more efficient
 solution.  We'll just have to figure out how to postpone computing the
-tail of the list until its needed...
+tail of the list until it's needed...
 
 The Continuation monad is amazingly flexible; we can use it to
 simulate some of the computations performed above.  To see how, first