[commit: nofib] master: fix some typos (77a87f1)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/nofib

On branch  : master
Link       : http://ghc.haskell.org/trac/ghc/changeset/77a87f18166aa4c806e33b0adf4c2fbe40551a4f/nofib

>---------------------------------------------------------------

commit 77a87f18166aa4c806e33b0adf4c2fbe40551a4f
Author: Gabor Greif <ggreif at gmail.com>
Date:   Fri Jan 10 12:02:06 2014 +0100

    fix some typos


>---------------------------------------------------------------

77a87f18166aa4c806e33b0adf4c2fbe40551a4f
 fibon/Hackage/Funsat/syb/tests/Bits.hs |    2 +-
 real/veritas/Lookup.hs                 |    2 +-
 spectral/salishan/id.tex               |    2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/fibon/Hackage/Funsat/syb/tests/Bits.hs b/fibon/Hackage/Funsat/syb/tests/Bits.hs
index 3c71f69..08816a7 100644
--- a/fibon/Hackage/Funsat/syb/tests/Bits.hs
+++ b/fibon/Hackage/Funsat/syb/tests/Bits.hs
@@ -12,7 +12,7 @@ internet.)
 
 Here is how it works.
 
-A constuctor is encoded as a bit stream. To this end, we encode the
+A constructor is encoded as a bit stream. To this end, we encode the
 index of the constructor as a binary number of a fixed length taking
 into account the maximum index for the type at hand. (Similarly, we
 could view the list of constructors as a binary tree, and then encode
diff --git a/real/veritas/Lookup.hs b/real/veritas/Lookup.hs
index e5c5c11..0ce5ba1 100644
--- a/real/veritas/Lookup.hs
+++ b/real/veritas/Lookup.hs
@@ -136,7 +136,7 @@ type Lookup_table = [Entry]
       | get_p1_nmsL rec_flag j [] = ([], j)
 
 (******************************************************************************)
-(*   Return the lookup table for the constuctors of a pass1 datatype          *)
+(*   Return the lookup table for the constructors of a pass1 datatype         *)
 (*   declaration                                                              *)
 (******************************************************************************)
 
diff --git a/spectral/salishan/id.tex b/spectral/salishan/id.tex
index 0a3f37a..c13f125 100644
--- a/spectral/salishan/id.tex
+++ b/spectral/salishan/id.tex
@@ -903,7 +903,7 @@ $n=0$, there is only one such radical--- a lone hydrogen atom.  When
 $n>0$, we construct all canonical 3-partitions $(i,j,k)$ of $n-1$; for
 each such partition, we generate, recursively, all radicals {\cf ri}
 of size $i$, all radicals {\cf rj} of size $j$ and all radicals {\cf
-rk} of size $k$, and constuct the new radical \mbox{\cf (C ri rj rk)}.
+rk} of size $k$, and construct the new radical \mbox{\cf (C ri rj rk)}.
 Here is the function:
 
  \beginid