summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGabor Greif <ggreif@gmail.com>2016-10-17 10:05:45 +0200
committerGabor Greif <ggreif@gmail.com>2016-10-17 10:05:45 +0200
commitf43db14e2cae9cd181b283cdc7d7940903689bf6 (patch)
treeceaf0525d4ac113cb7cffacd24baf1c5a758a1d3
parenta391a386e6cf00b8192c5d52a898a86a1e436eb8 (diff)
downloadhaskell-f43db14e2cae9cd181b283cdc7d7940903689bf6.tar.gz
Typos in comments
-rw-r--r--compiler/ghci/ByteCodeGen.hs2
-rw-r--r--compiler/hsSyn/HsUtils.hs2
-rw-r--r--compiler/nativeGen/PPC/CodeGen.hs2
-rw-r--r--compiler/typecheck/TcPatSyn.hs2
4 files changed, 4 insertions, 4 deletions
diff --git a/compiler/ghci/ByteCodeGen.hs b/compiler/ghci/ByteCodeGen.hs
index 90e2174228..0e7aea493e 100644
--- a/compiler/ghci/ByteCodeGen.hs
+++ b/compiler/ghci/ByteCodeGen.hs
@@ -433,7 +433,7 @@ schemeE d s p (AnnLet (AnnNonRec x (_,rhs)) (_,body))
Just data_con <- isDataConWorkId_maybe v,
dataConRepArity data_con == length args_r_to_l
= do -- Special case for a non-recursive let whose RHS is a
- -- saturatred constructor application.
+ -- saturated constructor application.
-- Just allocate the constructor and carry on
alloc_code <- mkConAppCode d s p data_con args_r_to_l
body_code <- schemeE (d+1) s (Map.insert x d p) body
diff --git a/compiler/hsSyn/HsUtils.hs b/compiler/hsSyn/HsUtils.hs
index 903ff380ee..de7736004d 100644
--- a/compiler/hsSyn/HsUtils.hs
+++ b/compiler/hsSyn/HsUtils.hs
@@ -774,7 +774,7 @@ collectLocalBinders (HsIPBinds _) = []
collectLocalBinders EmptyLocalBinds = []
collectHsIdBinders, collectHsValBinders :: HsValBindsLR idL idR -> [idL]
--- Collect Id binders only, or Ids + pattern synonmys, respectively
+-- Collect Id binders only, or Ids + pattern synonyms, respectively
collectHsIdBinders = collect_hs_val_binders True
collectHsValBinders = collect_hs_val_binders False
diff --git a/compiler/nativeGen/PPC/CodeGen.hs b/compiler/nativeGen/PPC/CodeGen.hs
index ead122b959..849516f229 100644
--- a/compiler/nativeGen/PPC/CodeGen.hs
+++ b/compiler/nativeGen/PPC/CodeGen.hs
@@ -744,7 +744,7 @@ temporary, then do the other computation, and then use the temporary:
{- Note [Power instruction format]
In some instructions the 16 bit offset must be a multiple of 4, i.e.
-the two least significant bits mus be zero. The "Power ISA" specification
+the two least significant bits must be zero. The "Power ISA" specification
calls these instruction formats "DS-FORM" and the instructions with
arbitrary 16 bit offsets are "D-FORM".
diff --git a/compiler/typecheck/TcPatSyn.hs b/compiler/typecheck/TcPatSyn.hs
index e6c5074935..dc973da98b 100644
--- a/compiler/typecheck/TcPatSyn.hs
+++ b/compiler/typecheck/TcPatSyn.hs
@@ -243,7 +243,7 @@ unify x := [a] during type checking, and then use the instantiating type
dl = $dfunEqList d
in k [a] dl ys
-This "concealing" story works for /uni-directional/ pattern synonmys,
+This "concealing" story works for /uni-directional/ pattern synonyms,
but obviously not for bidirectional ones. So in the bidirectional case
we use SigTv, rather than a generic TauTv, meta-tyvar so that. And
we should really check that those SigTvs don't get unified with each