Get rid of some stuttering in comments and docs

5 files changed, 5 insertions, 5 deletions

diff --git a/libraries/base/GHC/IO.hs b/libraries/base/GHC/IO.hs
index 118ebeaeed..8d69b707e1 100644
--- a/libraries/base/GHC/IO.hs
+++ b/libraries/base/GHC/IO.hs
@@ -334,7 +334,7 @@ onException io what = io `catchException` \e -> do _ <- what
 -- 'MaskedInterruptible' state,
 -- use @mask_ $ forkIO ...@.  This is particularly useful if you need
 -- to establish an exception handler in the forked thread before any
--- asynchronous exceptions are received.  To create a a new thread in
+-- asynchronous exceptions are received.  To create a new thread in
 -- an unmasked state use 'Control.Concurrent.forkIOWithUnmask'.
 --
 mask  :: ((forall a. IO a -> IO a) -> IO b) -> IO b
diff --git a/libraries/base/GHC/MVar.hs b/libraries/base/GHC/MVar.hs
index d367f2ba06..f334ddb48c 100644
--- a/libraries/base/GHC/MVar.hs
+++ b/libraries/base/GHC/MVar.hs
@@ -38,7 +38,7 @@ data MVar a = MVar (MVar# RealWorld a)
 {- ^
 An 'MVar' (pronounced \"em-var\") is a synchronising variable, used
 for communication between concurrent threads.  It can be thought of
-as a a box, which may be empty or full.
+as a box, which may be empty or full.
 -}
 
 -- pull in Eq (Mvar a) too, to avoid GHC.Conc being an orphan-instance module
diff --git a/libraries/base/tests/memo001.hs b/libraries/base/tests/memo001.hs
index 551bcd8cf4..bb43dd0cd4 100644
--- a/libraries/base/tests/memo001.hs
+++ b/libraries/base/tests/memo001.hs
@@ -12,7 +12,7 @@ testMemo = do
 -- mlength will memoize itself over each element of 'keys', returning
 -- the memoized result the second time around.  Then we move onto
 -- keys2, and while we're doing this the first lot of memo table
--- entries can be purged.  Finally, we do a a large computation
+-- entries can be purged.  Finally, we do a large computation
 -- (length [1..10000]) to allow time for the memo table to be fully
 -- purged.
 
diff --git a/libraries/ghc-prim/cbits/ctz.c b/libraries/ghc-prim/cbits/ctz.c
index 95f327a919..fc98716968 100644
--- a/libraries/ghc-prim/cbits/ctz.c
+++ b/libraries/ghc-prim/cbits/ctz.c
@@ -36,7 +36,7 @@ hs_ctz64(StgWord64 x)
      get inlined by GCC but rather a short `__ctzdi2` runtime function
      is inserted when needed into compiled object files.
 
-     This workaround forces GCC on 32bit x86 to to express `hs_ctz64` in
+     This workaround forces GCC on 32bit x86 to express `hs_ctz64` in
      terms of the 32bit `__builtin_ctz()` (this is no loss, as there's no
      64bit BSF instruction on i686 anyway) and thus avoid the problematic
      out-of-line runtime function.
diff --git a/libraries/integer-simple/GHC/Integer/Type.hs b/libraries/integer-simple/GHC/Integer/Type.hs
index cabdfe5a53..b46eda184a 100644
--- a/libraries/integer-simple/GHC/Integer/Type.hs
+++ b/libraries/integer-simple/GHC/Integer/Type.hs
@@ -781,7 +781,7 @@ quotRemPositive :: Positive -> Positive -> (# Integer, Integer #)
                                else Cons (ys `smallShiftLPositive` n)
                                          (mkSubtractors (n -# 1#))
 
-          -- The main function. Go the the end of xs, then walk
+          -- The main function. Go the end of xs, then walk
           -- back trying to divide the number we accumulate by ys.
           f :: Positive -> (# Digits, Digits #)
           f None = (# None, None #)