Commit 17ae5e79 authored by Gabor Greif's avatar Gabor Greif 💬

Typos in comments [skip ci]

parent 2219c8cd
......@@ -2056,7 +2056,7 @@ But nowadays when inferring the type of a function with no type signature,
even if there are errors inside, we still generalise its signature and
carry on. For example
f x = x:x
Here we will infer somethiing like
Here we will infer something like
f :: forall a. a -> [a]
with a deferred error of (a ~ [a]). So in the deferred unsolved constraint
'a' is now a skolem, but not one bound by the programmer in the context!
......
......@@ -252,7 +252,7 @@ non-regular, such as
data Nesty a = Z a | S (Nesty a) (Nest (a, a))
the function argument is no longer (entirely) static, so the static argument
transformation will do nothiing for us.
transformation will do nothing for us.
Applying the default definition of `<$` will produce a tree full of thunks that
look like ((\_ -> x) x0), which represents unnecessary thunk allocation and
......
......@@ -11,7 +11,7 @@ data Block = Block
block :: Q Exp
block =
[| Block {
-- Using record syntax is neccesary to trigger the bug.
-- Using record syntax is necessary to trigger the bug.
blockSelector = ()
}
|]
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