[patch] fix misspellings caught by Lintian

diff --git a/NEW b/NEW
index c951592c8..b1a2391d1 100644
--- a/NEW
+++ b/NEW
@@ -206,7 +206,7 @@ functions, see doc/refcard*.dvi or http://pari.math.u-bordeaux.fr/doc#refcard
 
     Functions varhigher() and varlower() allow to define
     variables of arbitrary priority independently of the session history;
-    variables() returns the list of variables occuring in an object:
+    variables() returns the list of variables occurring in an object:
      ? variable(x + y*z / t)
      %1 = x
      ? variables(x + y*z / t)
diff --git a/misc/color.dft b/misc/color.dft
index ba6177e42..3bb90015a 100644
--- a/misc/color.dft
+++ b/misc/color.dft
@@ -1,5 +1,5 @@
 !
-! Suggested default value for the color_xterm ressources for use under GP.
+! Suggested default value for the color_xterm resources for use under GP.
 ! See the color_xterm man for the meaning of these
 !
 
diff --git a/src/basemath/modsym.c b/src/basemath/modsym.c
index a0f359dd5..769d80dfa 100644
--- a/src/basemath/modsym.c
+++ b/src/basemath/modsym.c
@@ -304,7 +304,7 @@ Fl_inverse(ulong a, ulong N) { ulong g; return Fl_invgen(a,N,&g); }
  *   symbols: list of vectors [x,y] that give a set of representatives
  *            of P^1(Z/NZ)
  *   H: an M by M grid whose value at the r,c-th place is the index of the
- *      "standard representative" equivalent to [r,c] occuring in the first
+ *      "standard representative" equivalent to [r,c] occurring in the first
  *      list. If gcd(r,c,N) > 1 the grid has value 0. */
 static GEN
 create_p1mod(ulong N)
diff --git a/src/functions/conversions/variables b/src/functions/conversions/variables
index e64915c64..1b2e17099 100644
--- a/src/functions/conversions/variables
+++ b/src/functions/conversions/variables
@@ -2,10 +2,10 @@ Function: variables
 Section: conversions
 C-Name: variables_vec
 Prototype: DG
-Help: variables({x}): all variables occuring in object x, sorted by
+Help: variables({x}): all variables occurring in object x, sorted by
  decreasing priority. Returns the list of user variables if x is omitted.
 Doc:
- returns the list of all variables occuring in object $x$ (all user
+ returns the list of all variables occurring in object $x$ (all user
  variables known to the interpreter if $x$ is omitted), sorted by
  decreasing priority.
  \bprog
diff --git a/src/functions/modular_forms/getcache b/src/functions/modular_forms/getcache
index bd09b73da..b7ff5d33d 100644
--- a/src/functions/modular_forms/getcache
+++ b/src/functions/modular_forms/getcache
@@ -3,11 +3,11 @@ Section: modular_forms
 C-Name: getcache
 Prototype:
 Help: getcache(): returns information about various auto-growing caches. For
- each ressource, we report its name, its size, the number of cache misses
+ each resource, we report its name, its size, the number of cache misses
  (since the last extension) and the largest cache miss.
 Doc:
  returns information about various auto-growing caches. For
- each ressource, we report its name, its size, the number of cache misses
+ each resource, we report its name, its size, the number of cache misses
  (since the last extension), the largest cache miss and the size of the cache
  in bytes.
 
diff --git a/src/functions/modular_forms/mfisCM b/src/functions/modular_forms/mfisCM
index 0ec7c3234..a236590c4 100644
--- a/src/functions/modular_forms/mfisCM
+++ b/src/functions/modular_forms/mfisCM
@@ -5,12 +5,12 @@ Prototype: G
 Help: mfisCM(F): Tests whether the eigenform F is a CM form. The answer
  is 0 if it is not, and if it is, either the unique negative discriminant
  of the CM field, or the pair of two negative discriminants of CM fields,
- this latter case occuring only in weight 1 when the projective image is
+ this latter case occurring only in weight 1 when the projective image is
  D2=C2xC2, i.e., coded 4 by mfgaloistype.
 Doc: Tests whether the eigenform $F$ is a CM form. The answer
  is $0$ if it is not, and if it is, either the unique negative discriminant
  of the CM field, or the pair of two negative discriminants of CM fields,
- this latter case occuring only in weight $1$ when the projective image is
+ this latter case occurring only in weight $1$ when the projective image is
  $D_2=C_2\times C_2$, i.e., coded $4$ by \kbd{mfgaloistype}.
  \bprog
  ? F = mffromell(ellinit([0,1]))[2]; mfisCM(F)
diff --git a/src/functions/polynomials/thueinit b/src/functions/polynomials/thueinit
index d05bca2b8..2f753a1fb 100644
--- a/src/functions/polynomials/thueinit
+++ b/src/functions/polynomials/thueinit
@@ -4,7 +4,7 @@ C-Name: thueinit
 Prototype: GD0,L,p
 Help: thueinit(P,{flag=0}): initialize the tnf corresponding to P, that will
  be used to solve Thue equations P(x,y) = some-integer. If flag is non-zero,
- certify the result unconditionaly. Otherwise, assume GRH (much faster of
+ certify the result unconditionally. Otherwise, assume GRH (much faster of
  course).
 Doc: initializes the \var{tnf} corresponding to $P$, a non-constant
  univariate polynomial with integer coefficients.
diff --git a/src/functions/programming/listsort b/src/functions/programming/listsort
index a069aa14d..65db45487 100644
--- a/src/functions/programming/listsort
+++ b/src/functions/programming/listsort
@@ -3,7 +3,7 @@ Section: programming/specific
 C-Name: listsort
 Prototype: vWD0,L,
 Help: listsort(~L,{flag=0}): sort the list L in place. If flag is non-zero,
- suppress all but one occurence of each element in list.
+ suppress all but one occurrence of each element in list.
 Doc: sorts the \typ{LIST} \var{list} in place, with respect to the (somewhat
  arbitrary) universal comparison function \tet{cmp}. In particular, the
  ordering is the same as for sets and \tet{setsearch} can be used on a sorted

-----BEGIN PGP SIGNATURE-----

iHUEABYIAB0WIQT287WtmxUhmhucNnhyvHFIwKstpwUCXhJR1wAKCRByvHFIwKst
p3p2AQDpuUqjDhTa8BlXJBsVbknnf+gFOdTUYWfzyqC4fkrqvwD/X+vek59g2Y5K
HxiSLFktMmyAuO3L1C9EjJHDLSaWTAM=
=K+wQ
-----END PGP SIGNATURE-----