Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in / Register
Toggle navigation
GHC
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Locked Files
Issues
0
Issues
0
List
Boards
Labels
Service Desk
Milestones
Iterations
Merge Requests
0
Merge Requests
0
Requirements
Requirements
List
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Security & Compliance
Security & Compliance
Dependency List
License Compliance
Operations
Operations
Incidents
Environments
Packages & Registries
Packages & Registries
Package Registry
Container Registry
Analytics
Analytics
CI / CD
Code Review
Insights
Issue
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Alex D
GHC
Commits
148a50b5
Commit
148a50b5
authored
Jan 16, 2016
by
Rik Steenkamp
Committed by
thomie
Jan 16, 2016
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fix some typos
Differential Revision:
https://phabricator.haskell.org/D1785
parent
3c6635ef
Changes
8
Hide whitespace changes
Inline
Side-by-side
Showing
8 changed files
with
12 additions
and
13 deletions
+12
-13
compiler/coreSyn/CoreFVs.hs
compiler/coreSyn/CoreFVs.hs
+1
-1
compiler/hsSyn/HsBinds.hs
compiler/hsSyn/HsBinds.hs
+1
-1
compiler/hsSyn/HsTypes.hs
compiler/hsSyn/HsTypes.hs
+3
-4
compiler/main/DynFlags.hs
compiler/main/DynFlags.hs
+1
-1
compiler/rename/RnTypes.hs
compiler/rename/RnTypes.hs
+1
-1
compiler/typecheck/TcArrows.hs
compiler/typecheck/TcArrows.hs
+1
-1
compiler/typecheck/TcRnTypes.hs
compiler/typecheck/TcRnTypes.hs
+2
-2
docs/users_guide/glasgow_exts.rst
docs/users_guide/glasgow_exts.rst
+2
-2
No files found.
compiler/coreSyn/CoreFVs.hs
View file @
148a50b5
...
...
@@ -180,7 +180,7 @@ exprsSomeFreeVars fv_cand es =
addBndr
::
CoreBndr
->
FV
->
FV
addBndr
bndr
fv
fv_cand
in_scope
acc
=
(
varTypeTyCoVarsAcc
bndr
`
unionFV
`
-- Include type varibles in the binder's type
-- Include type vari
a
bles in the binder's type
-- (not just Ids; coercion variables too!)
FV
.
delFV
bndr
fv
)
fv_cand
in_scope
acc
...
...
compiler/hsSyn/HsBinds.hs
View file @
148a50b5
...
...
@@ -729,7 +729,7 @@ data Sig name
-- P :: forall a b. Prov => Req => ty
-- | A signature for a class method
-- False: ordinary class-method signa
u
ure
-- False: ordinary class-method signa
t
ure
-- True: default class method signature
-- e.g. class C a where
-- op :: a -> a -- Ordinary
...
...
compiler/hsSyn/HsTypes.hs
View file @
148a50b5
...
...
@@ -123,7 +123,7 @@ This is the syntax for types as seen in type signatures.
Note [HsBSig binder lists]
~~~~~~~~~~~~~~~~~~~~~~~~~~
Consider a binder (or pattern) deco
a
rated with a type or kind,
Consider a binder (or pattern) decorated with a type or kind,
\ (x :: a -> a). blah
forall (a :: k -> *) (b :: k). blah
Then we use a LHsBndrSig on the binder, so that the
...
...
@@ -140,7 +140,7 @@ is a bit complicated. Here's how it works.
* In a HsType,
HsForAllTy represents an /explicit, user-written/ 'forall'
e.g. forall a b. ...
HsQualTy reprsents an /explicit, user-written/ context
HsQualTy repr
e
sents an /explicit, user-written/ context
e.g. (Eq a, Show a) => ...
The context can be empty if that's what the user wrote
These constructors represent what the user wrote, no more
...
...
@@ -154,8 +154,7 @@ is a bit complicated. Here's how it works.
* HsImplicitBndrs is a wrapper that gives the implicitly-quantified
kind and type variables of the wrapped thing. It is filled in by
the renamer. For example, if the
user writes
the renamer. For example, if the user writes
f :: a -> a
the HsImplicitBinders binds the 'a' (not a HsForAllTy!).
NB: this implicit quantification is purely lexical: we bind any
...
...
compiler/main/DynFlags.hs
View file @
148a50b5
...
...
@@ -2448,7 +2448,7 @@ dynamic_flags = [
,
defFlag
"dppr-cols"
(
intSuffix
(
\
n
d
->
d
{
pprCols
=
n
}))
,
defGhcFlag
"dtrace-level"
(
intSuffix
(
\
n
d
->
d
{
traceLevel
=
n
}))
-- Suppress all that is suppressable in core dumps.
-- Except for uniques, as some simplifier phases introduce new varibles that
-- Except for uniques, as some simplifier phases introduce new vari
a
bles that
-- have otherwise identical names.
,
defGhcFlag
"dsuppress-all"
(
NoArg
$
do
setGeneralFlag
Opt_SuppressCoercions
...
...
compiler/rename/RnTypes.hs
View file @
148a50b5
...
...
@@ -87,7 +87,7 @@ rnHsSigWcTypeScoped :: HsDocContext -> LHsSigWcType RdrName
rnHsSigWcTypeScoped
ctx
sig_ty
thing_inside
=
rn_hs_sig_wc_type
False
ctx
sig_ty
thing_inside
-- False: for pattern type sigs and rules we /do/ want
-- to bring those type varibles into scope
-- to bring those type vari
a
bles into scope
-- e.g \ (x :: forall a. a-> b) -> e
-- Here we do bring 'b' into scope
...
...
compiler/typecheck/TcArrows.hs
View file @
148a50b5
...
...
@@ -37,7 +37,7 @@ import Util
import
Control.Monad
{-
Note [Arrow over
iv
ew]
Note [Arrow over
vi
ew]
~~~~~~~~~~~~~~~~~~~~~
Here's a summary of arrows and how they typecheck. First, here's
a cut-down syntax:
...
...
compiler/typecheck/TcRnTypes.hs
View file @
148a50b5
...
...
@@ -223,7 +223,7 @@ data Env gbl lcl
-- Includes all info about imported things
env_us
::
{-# UNPACK #-}
!
(
IORef
UniqSupply
),
-- Unique supply for local varibles
-- Unique supply for local vari
a
bles
env_gbl
::
gbl
,
-- Info about things defined at the top level
-- of the module being compiled
...
...
@@ -2005,7 +2005,7 @@ Note [Shadowing in a constraint]
We assume NO SHADOWING in a constraint. Specifically
* The unification variables are all implicitly quantified at top
level, and are all unique
* The skolem varibles bound in ic_skols are all freah when the
* The skolem vari
a
bles bound in ic_skols are all freah when the
implication is created.
So we can safely substitute. For example, if we have
forall a. a~Int => ...(forall b. ...a...)...
...
...
docs/users_guide/glasgow_exts.rst
View file @
148a50b5
...
...
@@ -932,7 +932,7 @@ Given a pattern synonym definition of the form ::
it is assigned a *pattern type* of the form ::
pattern P :: CReq => CPro
f
=> t1 -> t2 -> ... -> tN -> t
pattern P :: CReq => CPro
v
=> t1 -> t2 -> ... -> tN -> t
where ⟨CProv⟩ and ⟨CReq⟩ are type contexts, and ⟨t1⟩, ⟨t2⟩, ..., ⟨tN⟩
and ⟨t⟩ are types. Notice the unusual form of the type, with two
...
...
@@ -7976,7 +7976,7 @@ An implicit parameter is *bound* using the standard ``let`` or ``where``
binding
forms
.
For
example
,
we
define
the
``
min
``
function
by
binding
``
cmp
``.
::
min
::
[
a
]
->
a
min
::
Ord
a
=>
[
a
]
->
a
min
=
let
?
cmp
=
(<=)
in
least
A
group
of
implicit
-
parameter
bindings
may
occur
anywhere
a
normal
group
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a 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