X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=Control%2FMonad%2FState.hs;h=3fec375c7d6713e07f52a51239f166ae78785f39;hb=833c0251f3de7eafbc42b4ce67360e84afd071f4;hp=f11884985851816cae160e243438369148f20b34;hpb=e26cd9742d4ac05614191f394fbc5b752809cec4;p=ghc-base.git

diff --git a/Control/Monad/State.hs b/Control/Monad/State.hs
index f118849..3fec375 100644
--- a/Control/Monad/State.hs
+++ b/Control/Monad/State.hs
@@ -278,8 +278,8 @@ instance (Monoid w, MonadState s m) => MonadState s (WriterT w m) where
 -- > plus n x = execState (sequence $ replicate n tick) x
 --
 -- An example from /The Craft of Functional Programming/, Simon
--- Thompson (<http://www.cs.ukc.ac.uk/people/staff/sjt/>),
--- Addison-wesley 1999: \"Given an arbitrary tree, transform it to a
+-- Thompson (<http://www.cs.kent.ac.uk/people/staff/sjt/>),
+-- Addison-Wesley 1999: \"Given an arbitrary tree, transform it to a
 -- tree of integers in which the original elements are replaced by
 -- natural numbers, starting from 0.  The same element has to be
 -- replaced by the same number at every occurrence, and when we meet