Fix typos

9 files changed, 10 insertions, 10 deletions

diff --git a/libraries/base/Data/Traversable.hs b/libraries/base/Data/Traversable.hs
index d18b0ed98d..3c27c6e77e 100644
--- a/libraries/base/Data/Traversable.hs
+++ b/libraries/base/Data/Traversable.hs
@@ -604,7 +604,7 @@ foldMapDefault = coerce (traverse :: (a -> Const m ()) -> t a -> Const m (t ()))
 -- Left ("That's odd",9)
 --
 -- The 'Foldable' instance should be defined in a manner that avoids
--- construction of an unnecesary copy of the container.
+-- construction of an unnecessary copy of the container.
 --
 -- The @Foldable@ method 'mapM_' and its flipped version 'forM_' can be used
 -- to sequence IO actions over all the elements of a @Traversable@ container
diff --git a/libraries/base/GHC/Event/Windows.hsc b/libraries/base/GHC/Event/Windows.hsc
index ea2c51053a..d9a107bbd0 100644
--- a/libraries/base/GHC/Event/Windows.hsc
+++ b/libraries/base/GHC/Event/Windows.hsc
@@ -564,7 +564,7 @@ withOverlappedEx mgr fname h offset startCB completionCB = do
         -- relied on for non-file handles we need a way to prevent
         -- us from handling a request inline and handle a completion
         -- event handled without a queued I/O operation.  Which means we
-        -- can't solely rely on the number of oustanding requests but most
+        -- can't solely rely on the number of outstanding requests but most
         -- also check intermediate status.
         reqs <- addRequest
         debugIO $ "+1.. " ++ show reqs ++ " requests queued. | " ++ show lpol
diff --git a/libraries/base/GHC/ForeignPtr.hs b/libraries/base/GHC/ForeignPtr.hs
index 718b5a8749..a64d4d19c6 100644
--- a/libraries/base/GHC/ForeignPtr.hs
+++ b/libraries/base/GHC/ForeignPtr.hs
@@ -134,7 +134,7 @@ data ForeignPtrContents
     -- reachable (by GC) whenever the 'ForeignPtr' is reachable. When the
     -- 'ForeignPtr' becomes unreachable, the runtime\'s normal GC recovers
     -- the memory backing it. Here, the finalizer function intended to be used
-    -- to @free()@ any ancilliary *unmanaged* memory pointed to by the
+    -- to @free()@ any ancillary *unmanaged* memory pointed to by the
     -- 'MutableByteArray#'. See the @zlib@ library for an example of this use.
     --
     -- 1. Invariant: The 'Addr#' in the parent 'ForeignPtr' is an interior
diff --git a/libraries/base/GHC/IO/Windows/Encoding.hs b/libraries/base/GHC/IO/Windows/Encoding.hs
index c0ee649662..d86487bc5f 100644
--- a/libraries/base/GHC/IO/Windows/Encoding.hs
+++ b/libraries/base/GHC/IO/Windows/Encoding.hs
@@ -9,7 +9,7 @@
    Stability   :  Provisional
    Portability :  Non-portable (Win32 API)
 
-   Enocode/Decode mutibyte charactor using Win32 API.
+   Enocode/Decode mutibyte character using Win32 API.
 -}
 
 module GHC.IO.Windows.Encoding
diff --git a/libraries/base/GHC/IO/Windows/Handle.hsc b/libraries/base/GHC/IO/Windows/Handle.hsc
index ba7f4d1488..9a28b0dda2 100644
--- a/libraries/base/GHC/IO/Windows/Handle.hsc
+++ b/libraries/base/GHC/IO/Windows/Handle.hsc
@@ -884,7 +884,7 @@ openFile' filepath iomode non_blocking tmp_opts =
                -- on the Haskell side by using existing mechanisms such as MVar
                -- or IOPorts.
                then #{const FILE_FLAG_OVERLAPPED}
-                    -- I beleive most haskell programs do sequential scans, so
+                    -- I believe most haskell programs do sequential scans, so
                     -- optimize for the common case.  Though ideally, this would
                     -- be parameterized by openFile.  This will absolutely trash
                     -- the cache on reverse scans.
diff --git a/libraries/base/Unsafe/Coerce.hs b/libraries/base/Unsafe/Coerce.hs
index 6792592254..7c8e39e92e 100644
--- a/libraries/base/Unsafe/Coerce.hs
+++ b/libraries/base/Unsafe/Coerce.hs
@@ -132,7 +132,7 @@ several ways
             x = K a
         in ...
      Flaoting the case is OK here, even though it broardens the
-     scope, becuase we are done with simplification.
+     scope, because we are done with simplification.
 
 (U4) GHC.CoreToStg.Prep.cpeExprIsTrivial anticipates the
      upcoming discard of unsafeEqualityProof.
@@ -220,7 +220,7 @@ There are yet more wrinkles
       GHCi debugger, and GHCi itself uses unsafeCoerce.
 
       Moreover, in GHC.Tc.Module.tcGhciStmts we use unsafeCoerce#, rather
-      than the more kosher unsafeCoerce, becuase (with -O0) the latter
+      than the more kosher unsafeCoerce, because (with -O0) the latter
       may not be inlined.
 
       Sigh
diff --git a/libraries/base/tests/perf/Makefile b/libraries/base/tests/perf/Makefile
index 28840dc0b9..8ffa651a33 100644
--- a/libraries/base/tests/perf/Makefile
+++ b/libraries/base/tests/perf/Makefile
@@ -9,7 +9,7 @@ include $(TOP)/mk/test.mk
 
 T17752:
 	'$(TEST_HC)' $(TEST_HC_OPTS) -O --make T17752 -rtsopts -ddump-simpl -ddump-to-file -dsuppress-uniques -dsuppress-all
-	# All occurences of elem should be optimized away.
+	# All occurrences of elem should be optimized away.
 	# For strings these should result in loops after inlining foldCString.
 	# For lists it should result in a case expression.
 	echo $$(cat T17752.dump-simpl | grep "elem" -A4 )
diff --git a/libraries/base/tests/perf/T17752.hs b/libraries/base/tests/perf/T17752.hs
index f7f136e1f4..3c4565ec9c 100644
--- a/libraries/base/tests/perf/T17752.hs
+++ b/libraries/base/tests/perf/T17752.hs
@@ -1,6 +1,6 @@
 module T17752 where
 
--- All occurences of elem should be optimized away.
+-- All occurrences of elem should be optimized away.
 -- For strings these should result in loops after inlining foldCString.
 -- For lists it should result in a case expression.
 
diff --git a/libraries/ghc-bignum/src/GHC/Num/Integer.hs b/libraries/ghc-bignum/src/GHC/Num/Integer.hs
index 35afa5d15a..ae0d6af20b 100644
--- a/libraries/ghc-bignum/src/GHC/Num/Integer.hs
+++ b/libraries/ghc-bignum/src/GHC/Num/Integer.hs
@@ -577,7 +577,7 @@ integerTestBit# (IN x) i
    | isTrue# (iw >=# n)
    = 1#
    -- if all the limbs j with j < iw are null, then we have to consider the
-   -- carry of the 2's complement convertion. Otherwise we just have to return
+   -- carry of the 2's complement conversion. Otherwise we just have to return
    -- the inverse of the bit test
    | allZ iw = testBitW# (xi `minusWord#` 1##) ib ==# 0#
    | True    = testBitW# xi ib ==# 0#