X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week7.mdwn;h=0e9f25ef8455d508c33571e9734d644e59e50d94;hp=79983c3eb524ad560ae2d5f45a2bafb0b38d8da8;hb=b0139eb9a0b1865ca04f76157ce8dcfbd203374b;hpb=11a31a071405f0eb9bc48ea98e5e9ee592fac245

diff --git a/week7.mdwn b/week7.mdwn
index 79983c3e..0e9f25ef 100644
--- a/week7.mdwn
+++ b/week7.mdwn
@@ -457,7 +457,7 @@ presented here, a monad is not exactly a monoid, because (unlike the
 arguments of a monoid operation) the two arguments of the bind are of
 different types.  But it's possible to make the connection between
 monads and monoids much closer. This is discussed in [Monads in Category
-Theory](/advanced_notes/monads_in_category_theory).
+Theory](/advanced_topics/monads_in_category_theory).
 See also <http://www.haskell.org/haskellwiki/Monad_Laws>.
 
 Here are some papers that introduced monads into functional programming: