Squash some spelling issues

9 files changed, 12 insertions, 12 deletions

diff --git a/docs/comm/exts/th.html b/docs/comm/exts/th.html
index dbb168aa0e..539245db74 100644
--- a/docs/comm/exts/th.html
+++ b/docs/comm/exts/th.html
@@ -131,7 +131,7 @@ Core Language.Haskell.TH.Syntax.Type</pre>
       appear. 
     </p>
 
-    <h3>Binders Versus Occurences</h3>
+    <h3>Binders Versus Occurrences</h3>
     <p>
       Name lookups in the meta environment of the desugarer use two functions
       with slightly different behaviour, namely <code>DsMeta.lookupOcc</code>
diff --git a/docs/comm/the-beast/basicTypes.html b/docs/comm/the-beast/basicTypes.html
index ca56d6b6a8..b411e4c5a9 100644
--- a/docs/comm/the-beast/basicTypes.html
+++ b/docs/comm/the-beast/basicTypes.html
@@ -41,7 +41,7 @@
       <code>IdInfo</code>:
     <p>
     <dl>
-      <dt><a name="occInfo">Occurence information</a>
+      <dt><a name="occInfo">Occurrence information</a>
       <dd>The <code>OccInfo</code> data type is defined in the module <a
 	href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/basicTypes/BasicTypes.lhs"><code>BasicTypes.lhs</code></a>.
 	Apart from the trivial <code>NoOccInfo</code>, it distinguishes
diff --git a/docs/comm/the-beast/renamer.html b/docs/comm/the-beast/renamer.html
index 828b569bb9..878e82b370 100644
--- a/docs/comm/the-beast/renamer.html
+++ b/docs/comm/the-beast/renamer.html
@@ -194,7 +194,7 @@ data Provenance
       <code>RdrName</code> environment, which contains <code>Name</code>s for
       all imported <em>and</em> all locally defined toplevel binders.  Hence,
       when the helpers of <code>rnSrcDecls</code> come across the
-      <em>defining</em> occurences of a toplevel <code>RdrName</code>, they
+      <em>defining</em> occurrences of a toplevel <code>RdrName</code>, they
       don't rename it by generating a new name, but they simply look up its
       name in the global <code>RdrName</code> environment.
     </p>
diff --git a/docs/comm/the-beast/simplifier.html b/docs/comm/the-beast/simplifier.html
index 40cf7cf892..4dbce7765b 100644
--- a/docs/comm/the-beast/simplifier.html
+++ b/docs/comm/the-beast/simplifier.html
@@ -37,7 +37,7 @@
       computes a set of <em>loop breakers</em> - a set of definitions that
       together cut any possible loop in the binding group.  It marks the
       identifiers bound by these definitions as loop breakers by enriching
-      their <a href="basicTypes.html#occInfo">occurence information.</a>  Loop
+      their <a href="basicTypes.html#occInfo">occurrence information.</a>  Loop
       breakers will <em>never</em> be inlined by the simplifier; thus,
       guaranteeing termination of the simplification procedure.  (This is not
       entirely accurate -- see <a href="#rules">rewrite rules</a> below.)
diff --git a/docs/comm/the-beast/stg.html b/docs/comm/the-beast/stg.html
index 4581da7d1f..6c9851623a 100644
--- a/docs/comm/the-beast/stg.html
+++ b/docs/comm/the-beast/stg.html
@@ -75,10 +75,10 @@
     <p>
       The representation of STG language defined in <a
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/stgSyn/StgSyn.lhs"><code>StgSyn</code></a>
-      abstracts over both binders and occurences of variables.  The type names
+      abstracts over both binders and occurrences of variables.  The type names
       involved in this generic definition all carry the prefix
       <code>Gen</code> (such as in <code>GenStgBinding</code>).  Instances of
-      these generic definitions, where both binders and occurences are of type
+      these generic definitions, where both binders and occurrences are of type
       <a
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/basicTypes/Id.lhs"><code>Id</code></a><code>.Id</code>
       are defined as type synonyms and use type names that drop the
diff --git a/docs/comm/the-beast/typecheck.html b/docs/comm/the-beast/typecheck.html
index 8d22784b8a..482a447628 100644
--- a/docs/comm/the-beast/typecheck.html
+++ b/docs/comm/the-beast/typecheck.html
@@ -21,7 +21,7 @@
       GHC defines the abstract syntax of Haskell programs in <a
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/hsSyn/HsSyn.lhs"><code>HsSyn</code></a>
       using a structure that abstracts over the concrete representation of
-      bound occurences of identifiers and patterns.  The module <a
+      bound occurrences of identifiers and patterns.  The module <a
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/typecheck/TcHsSyn.lhs"><code>TcHsSyn</code></a>
       defines a number of helper function required by the type checker.  Note
       that the type <a
@@ -248,7 +248,7 @@ tau   -> tyvar
       Expressions are type checked by <a
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/typecheck/TcExpr.lhs"><code>TcExpr</code>.</a>  
     <p>
-      Usage occurences of identifiers are processed by the function
+      Usage occurrences of identifiers are processed by the function
       <code>tcId</code> whose main purpose is to <a href="#inst">instantiate
       overloaded identifiers.</a> It essentially calls
       <code>TcInst.instOverloadedFun</code> once for each universally
@@ -275,7 +275,7 @@ tau   -> tyvar
       href="http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/ghc/compiler/typecheck/Inst.lhs"><code>Inst.lhs</code>.</a>
     <p>
       The function <code>instOverloadedFun</code> is invoked for each
-      overloaded usage occurence of an identifier, where overloaded means that
+      overloaded usage occurrence of an identifier, where overloaded means that
       the type of the idendifier contains a non-trivial type constraint.  It
       proceeds in two steps: (1) Allocation of a method instance
       (<code>newMethodWithGivenTy</code>) and (2) instantiation of functional
diff --git a/docs/ndp/haskell.sty b/docs/ndp/haskell.sty
index 969ad673fe..3e4d478b1e 100644
--- a/docs/ndp/haskell.sty
+++ b/docs/ndp/haskell.sty
@@ -87,7 +87,7 @@
 \ProvidesPackage{haskell}[2002/02/08 v1.1a Chilli's Haskell Style]
 
 % NOTE: The sole purpose of the following is to work around what I believe is
-%       a bug in LaTeX.  If the first occurence of \mathit in a document uses
+%       a bug in LaTeX.  If the first occurrence of \mathit in a document uses
 %       \bgroup and \egroup to enclose the argument (instead of { and }),
 %       \mathit does *not* apply to the argument.  (I guess, some font
 %       initialisation stuff is getting in the way of parsing the argument.)
diff --git a/docs/ndp/vect.tex b/docs/ndp/vect.tex
index 1244972374..cf6ee77ed0 100644
--- a/docs/ndp/vect.tex
+++ b/docs/ndp/vect.tex
@@ -243,7 +243,7 @@ Note that this is precisely the reason for the \<\parr{\cdot}\> instances for
 \<\alpha\to\beta\> and \<PA \alpha\>. A term of type \<\forall\alpha.\sigma\>
 will be lifted to a term of type
 \<\parr{\forall\alpha.PA \alpha\to\vect{\sigma}}\> which requires the
-instances. Apart from closures, these are the only occurences of \<({\to})\> in
+instances. Apart from closures, these are the only occurrences of \<({\to})\> in
 the transformed program, however.
 
 
diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml
index 77be1e7bf6..23ba91cefd 100644
--- a/docs/users_guide/glasgow_exts.xml
+++ b/docs/users_guide/glasgow_exts.xml
@@ -1103,7 +1103,7 @@ pattern (Show b) => ExNumPat b :: (Num a, Eq a) => T a
 <listitem> Matching:
 
 <para>
-A pattern synonym occurance in a pattern is evaluated by first
+A pattern synonym occurrence in a pattern is evaluated by first
 matching against the pattern synonym itself, and then on the argument
 patterns. For example, in the following program, <literal>f</literal>
 and <literal>f'</literal> are equivalent: