Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
Menu
Open sidebar
Tobias Decking
GHC
Commits
ae1f2718
Commit
ae1f2718
authored
Dec 17, 2014
by
Gabor Greif
💬
Browse files
Typos in comments
parent
922168fd
Changes
4
Hide whitespace changes
Inline
Side-by-side
compiler/simplCore/Simplify.hs
View file @
ae1f2718
...
...
@@ -2644,7 +2644,7 @@ Note [Funky mkPiTypes]
~~~~~~~~~~~~~~~~~~~~~~
Notice the funky mkPiTypes. If the contructor has existentials
it's possible that the join point will be abstracted over
type var
a
ibles as well as term variables.
type vari
a
bles as well as term variables.
Example: Suppose we have
data T = forall t. C [t]
Then faced with
...
...
compiler/typecheck/TcHsType.hs
View file @
ae1f2718
...
...
@@ -1374,7 +1374,7 @@ Here the type of x's first component is called 'a1' in one branch and
they definitely won't have the sane lexical Name.
I think we could solve this by recording in a SigTv a list of all the
in-scope var
a
ibles that it should not unify with, but it's fiddly.
in-scope vari
a
bles that it should not unify with, but it's fiddly.
************************************************************************
...
...
compiler/typecheck/TcSimplify.hs
View file @
ae1f2718
...
...
@@ -634,7 +634,7 @@ and if so refrain from quantifying over *any* equalites.
simplifyRule
::
RuleName
->
WantedConstraints
-- Constraints from LHS
->
WantedConstraints
-- Constraints from RHS
->
TcM
([
EvVar
],
WantedConstraints
)
-- LHS evidence var
a
ibles
->
TcM
([
EvVar
],
WantedConstraints
)
-- LHS evidence vari
a
bles
-- See Note [Simplifying RULE constraints] in TcRule
simplifyRule
name
lhs_wanted
rhs_wanted
=
do
{
-- We allow ourselves to unify environment
...
...
compiler/typecheck/TcTyClsDecls.hs
View file @
ae1f2718
...
...
@@ -1095,7 +1095,7 @@ Then in the family instance we want to
KindFam (Maybe k) k' a b = T k k' a b -> Int
Notice that in the third step we quantify over all the visibly-mentioned
type variables (a,b), but also over the implicitly mentioned kind var
a
ibles
type variables (a,b), but also over the implicitly mentioned kind vari
a
bles
(k, k'). In this case one is bound explicitly but often there will be
none. The role of the kind signature (a :: Maybe k) is to add a constraint
that 'a' must have that kind, and to bring 'k' into scope.
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment