Commit 99fe579d authored by Gabor Greif's avatar Gabor Greif 💬

Typos in changelog and comments

parent 5dddf354
......@@ -525,7 +525,7 @@ by 'competesWith'
Class methods have a built-in RULE to select the method from the dictionary,
so you can't change the phase on this. That makes id very dubious to
match on class methods in RULE lhs's. See Trac #10595. I'm not happy
about this. For exmaple in Control.Arrow we have
about this. For example in Control.Arrow we have
{-# RULES "compose/arr" forall f g .
(arr f) . (arr g) = arr (f . g) #-}
......
......@@ -1104,7 +1104,7 @@ lvlBind env (AnnRec pairs)
-- Both are checked by Lint
is_fun = all isFunction rhss
is_bot = False -- It's odd to have an unconditionally divergent
-- funtion in a Rec, and we don't much care what
-- function in a Rec, and we don't much care what
-- happens to it. False is simple!
do_rhs env (bndr,rhs) = lvlFloatRhs abs_vars dest_lvl env Recursive
......
......@@ -777,7 +777,7 @@ But it is much better to specialise f for the case where the argument
is of form (I# x); then we build the box only when returning y, which
is on the cold path.
Another exmaple:
Another example:
f x = ...(g x)....
......
......@@ -2475,7 +2475,7 @@ doTyLit kc t = do { kc_clas <- tcLookupClass kc
{- Note [Typeable (T a b c)]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~
For type applications we always decompose using binary application,
via doTyApp, until we get to a *kind* instantiation. Exmaple
via doTyApp, until we get to a *kind* instantiation. Example
Proxy :: forall k. k -> *
To solve Typeable (Proxy (* -> *) Maybe) we
......
......@@ -243,7 +243,7 @@ one approach is to instantiate all of C's superclasses, transitively.
We can only do so if that set is finite.
This potential loop occurs only through superclasses. This, for
exmaple, is fine
example, is fine
class C a where
op :: C b => a -> b -> b
even though C's full definition uses C.
......
......@@ -442,7 +442,7 @@ fi
# name (this is a known problem in the case of the Android NDK, which has
# slightly odd triples).
#
# It may be better to just do away with the GHC triples all together. This would
# It may be better to just do away with the GHC triples altogether. This would
# all be taken care of for us if we configured the subprojects using
# AC_CONFIG_DIR, but unfortunately Cabal needs to be the one to do the
# configuration.
......
......@@ -687,7 +687,7 @@ readConstr dt str =
------------------------------------------------------------------------------
--
-- Convenience funtions: algebraic data types
-- Convenience functions: algebraic data types
--
------------------------------------------------------------------------------
......
......@@ -173,7 +173,7 @@ charSize = 4
--
-- The "live" elements of the buffer are those between the 'bufL' and
-- 'bufR' offsets. In an empty buffer, 'bufL' is equal to 'bufR', but
-- they might not be zero: for exmaple, the buffer might correspond to
-- they might not be zero: for example, the buffer might correspond to
-- a memory-mapped file and in which case 'bufL' will point to the
-- next location to be written, which is not necessarily the beginning
-- of the file.
......
......@@ -74,7 +74,7 @@
non-exhaustive pattern-match warnings (#8779)
* Change the implementations of `maximumBy` and `minimumBy` from
`Data.Foldable` to use `fold11` instead of `foldr1`. This makes them run
`Data.Foldable` to use `foldl1` instead of `foldr1`. This makes them run
in constant space when applied to lists. (#10830)
## 4.9.0.0 *May 2016*
......
......@@ -51,7 +51,7 @@ complexFD = id :: (forall b. MyEq b Bool => b->b)
complexTF = id :: (forall b. b~Bool => b->b)
-> (forall c. c~Bool => c->c)
{- For exmaple, here is how the subsumption check works for complexTF
{- For example, here is how the subsumption check works for complexTF
when type-checking the expression
(id :: (forall b. b~Bool => b->b) -> (forall c. c~Bool => c->c))
......
{-# LANGUAGE ExistentialQuantification #-}
-- Exmaples from Doaitse Swierestra and Brandon Moore
-- Examples from Doaitse Swierstra and Brandon Moore
-- GHC users mailing list, April 07, title "Release plans"
-- This one should fail, but Hugs passes it
......
......@@ -371,7 +371,7 @@ readConstr dt str =
------------------------------------------------------------------------------
--
-- Convenience funtions: algebraic data types
-- Convenience functions: algebraic data types
--
------------------------------------------------------------------------------
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment