X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=docs%2Fusers_guide%2Fglasgow_exts.xml;h=e1795f2b28e159f308dbbc108ee85afd4c4b1f68;hb=67d845652defc09807eaf134c6d30c8bd26b665a;hp=2490855393030fb4540b5dfa24052296cc2fc795;hpb=9c2dfd97d008c04c2f86a4a58fa7c3c956f7bedc;p=ghc-hetmet.git
diff --git a/docs/users_guide/glasgow_exts.xml b/docs/users_guide/glasgow_exts.xml
index 2490855..e1795f2 100644
--- a/docs/users_guide/glasgow_exts.xml
+++ b/docs/users_guide/glasgow_exts.xml
@@ -427,7 +427,7 @@ Indeed, the bindings can even be recursive.
The hash sign does not change semantics at all. We tend to use variable
names ending in "#" for unboxed values or types (e.g. Int#),
- but there is no requirement to do so; they are just plain ordinary variables.
+ but there is no requirement to do so; they are just plain ordinary variables.
Nor does the extension bring anything into scope.
For example, to bring Int# into scope you must
import GHC.Prim (see );
@@ -2799,7 +2799,7 @@ different constructors. For example, this is fine:
T1 :: Eq b => b -> b -> T b
T2 :: (Show c, Ix c) => c -> [c] -> T c
-When patten matching, these constraints are made available to discharge constraints
+When pattern matching, these constraints are made available to discharge constraints
in the body of the match. For example:
f :: T a -> String
@@ -4031,7 +4031,7 @@ But these are not:
-- Context assertion no smaller than head
instance C a => C a where ...
- -- (C b b) has more more occurrences of b than the head
+ -- (C b b) has more occurrences of b than the head
instance C b b => Foo [b] where ...
@@ -6464,7 +6464,7 @@ Wiki page.
must have type Q [Dec]
Note that pattern splices are not supported.
- Inside a splice you can can only call functions defined in imported modules,
+ Inside a splice you can only call functions defined in imported modules,
not functions defined elsewhere in the same module.
@@ -7518,7 +7518,7 @@ That leaves let expressions, whose translation is given in
of the Haskell Report.
In the translation box, first apply
the following transformation: for each pattern pi that is of
-form !qi = ei, transform it to (xi,!qi) = ((),ei), and and replace e0
+form !qi = ei, transform it to (xi,!qi) = ((),ei), and replace e0
by (xi `seq` e0). Then, when none of the left-hand-side patterns
have a bang at the top, apply the rules in the existing box.