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
4,251
Issues
4,251
List
Boards
Labels
Service Desk
Milestones
Iterations
Merge Requests
394
Merge Requests
394
Requirements
Requirements
List
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Security & Compliance
Security & Compliance
Dependency List
License Compliance
Operations
Operations
Incidents
Environments
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
Glasgow Haskell Compiler
GHC
Commits
e28fbbb7
Commit
e28fbbb7
authored
Feb 13, 2017
by
Gabor Greif
💬
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Typos [ci skip]
parent
93e65c8a
Changes
12
Hide whitespace changes
Inline
Side-by-side
Showing
12 changed files
with
14 additions
and
14 deletions
+14
-14
compiler/coreSyn/CoreUtils.hs
compiler/coreSyn/CoreUtils.hs
+2
-2
compiler/hsSyn/HsExpr.hs
compiler/hsSyn/HsExpr.hs
+1
-1
compiler/prelude/TysWiredIn.hs
compiler/prelude/TysWiredIn.hs
+1
-1
compiler/rename/RnPat.hs
compiler/rename/RnPat.hs
+1
-1
compiler/simplCore/SetLevels.hs
compiler/simplCore/SetLevels.hs
+1
-1
compiler/typecheck/TcSimplify.hs
compiler/typecheck/TcSimplify.hs
+1
-1
compiler/types/Type.hs
compiler/types/Type.hs
+1
-1
docs/users_guide/glasgow_exts.rst
docs/users_guide/glasgow_exts.rst
+1
-1
rts/RetainerProfile.c
rts/RetainerProfile.c
+1
-1
rts/Trace.c
rts/Trace.c
+1
-1
testsuite/tests/programs/andy_cherry/Main.hs
testsuite/tests/programs/andy_cherry/Main.hs
+2
-2
testsuite/tests/typecheck/should_compile/tc146.hs
testsuite/tests/typecheck/should_compile/tc146.hs
+1
-1
No files found.
compiler/coreSyn/CoreUtils.hs
View file @
e28fbbb7
...
...
@@ -1662,7 +1662,7 @@ dataConInstPat fss uniqs con inst_tys
-- Make the instantiating substitution for universals
univ_subst
=
zipTvSubst
univ_tvs
inst_tys
-- Make existential type variables, applying
n
and extending the substitution
-- Make existential type variables, applying and extending the substitution
(
full_subst
,
ex_bndrs
)
=
mapAccumL
mk_ex_var
univ_subst
(
zip3
ex_tvs
ex_fss
ex_uniqs
)
...
...
@@ -1844,7 +1844,7 @@ diffExpr _ _ e1 e2
-- all possible mappings, which would be seriously expensive. So
-- instead we simply match single bindings as far as we can. This
-- leaves us just with mutually recursive and/or mismatching bindings,
-- which we then specuatively match by ordering them. It's by no means
-- which we then specu
l
atively match by ordering them. It's by no means
-- perfect, but gets the job done well enough.
diffBinds
::
Bool
->
RnEnv2
->
[(
Var
,
CoreExpr
)]
->
[(
Var
,
CoreExpr
)]
->
([
SDoc
],
RnEnv2
)
...
...
compiler/hsSyn/HsExpr.hs
View file @
e28fbbb7
...
...
@@ -2102,7 +2102,7 @@ instance Data ThModFinalizers where
data
HsSplicedThing
id
=
HsSplicedExpr
(
HsExpr
id
)
-- ^ Haskell Spliced Expression
|
HsSplicedTy
(
HsType
id
)
-- ^ Haskell Spliced Type
|
HsSplicedPat
(
Pat
id
)
-- ^ Haskell Sp
il
ced Pattern
|
HsSplicedPat
(
Pat
id
)
-- ^ Haskell Sp
li
ced Pattern
deriving
Typeable
deriving
instance
(
DataId
id
)
=>
Data
(
HsSplicedThing
id
)
...
...
compiler/prelude/TysWiredIn.hs
View file @
e28fbbb7
...
...
@@ -34,7 +34,7 @@ module TysWiredIn (
gtDataCon
,
gtDataConId
,
promotedLTDataCon
,
promotedEQDataCon
,
promotedGTDataCon
,
-- * Boxi
gn
primitive types
-- * Boxi
ng
primitive types
boxingDataCon_maybe
,
-- * Char
...
...
compiler/rename/RnPat.hs
View file @
e28fbbb7
...
...
@@ -695,7 +695,7 @@ Consider (Trac #12130)
funny = [| MkT { x = 3 } |]
When we splice, neither T nor MkT are lexically in scope, so find_tycon will
fail. But there is no need for diambiguation anyway, so we just return Nothing
fail. But there is no need for di
s
ambiguation anyway, so we just return Nothing
-}
rnHsRecUpdFields
...
...
compiler/simplCore/SetLevels.hs
View file @
e28fbbb7
...
...
@@ -506,7 +506,7 @@ Consider this:
}
Because of the binder-swap, the inner case will get substituted to
(case x of ..). So when testing whether the scrutinee is
okForSpecuation we must be careful to test the *result* scrutinee ('x'
okForSpecu
l
ation we must be careful to test the *result* scrutinee ('x'
in this case), not the *input* one 'y'. The latter *is* ok for
speculation here, but the former is not -- and indeed we can't float
the inner case out, at least not unless x is also evaluated at its
...
...
compiler/typecheck/TcSimplify.hs
View file @
e28fbbb7
...
...
@@ -1965,7 +1965,7 @@ to beta[1], and that means the (a ~ beta[1]) will be stuck, as it should be.
*********************************************************************************
* *
* Defaulting and disam
g
iguation *
* Defaulting and disam
b
iguation *
* *
*********************************************************************************
-}
...
...
compiler/types/Type.hs
View file @
e28fbbb7
...
...
@@ -611,7 +611,7 @@ Note [Decomposing fat arrow c=>t]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Can we unify (a b) with (Eq a => ty)? If we do so, we end up with
a partial application like ((=>) Eq a) which doesn't make sense in
source Haskell. In con
s
trast, we *can* unify (a b) with (t1 -> t2).
source Haskell. In contrast, we *can* unify (a b) with (t1 -> t2).
Here's an example (Trac #9858) of how you might do it:
i :: (Typeable a, Typeable b) => Proxy (a b) -> TypeRep
i p = typeRep p
...
...
docs/users_guide/glasgow_exts.rst
View file @
e28fbbb7
...
...
@@ -146,7 +146,7 @@ specifies their runtime representation. For example, the type ``Int#`` has
kind ``TYPE '
IntRep
``
and
``
Double
#``
has
kind
``
TYPE
'DoubleRep``. These
kinds say that the runtime representation of an ``Int#`` is a machine integer,
and the runtime representation of a ``Double#`` is a machine double-precision
floating point. In con
s
trast, the kind ``*`` is actually just a synonym
floating point. In contrast, the kind ``*`` is actually just a synonym
for ``TYPE '
PtrRepLifted
``.
More
details
of
the
``
TYPE
``
mechanisms
appear
in
the
`
section
on
runtime
representation
polymorphism
<#
runtime
-
rep
>`
__
.
...
...
rts/RetainerProfile.c
View file @
e28fbbb7
...
...
@@ -1837,7 +1837,7 @@ computeRetainerSet( void )
* and reset their rs fields to NULL, which is accomplished by
* invoking maybeInitRetainerSet(). This function must be called
* before zeroing all objects reachable from scavenged_static_objects
* in the case of major gabage collections. See GarbageCollect() in
* in the case of major ga
r
bage collections. See GarbageCollect() in
* GC.c.
* Note:
* The mut_once_list of the oldest generation must also be traversed?
...
...
rts/Trace.c
View file @
e28fbbb7
...
...
@@ -42,7 +42,7 @@ static Mutex trace_utx;
static
bool
eventlog_enabled
;
/* ---------------------------------------------------------------------------
Starting up / shutt
t
ing down the tracing facilities
Starting up / shutting down the tracing facilities
--------------------------------------------------------------------------- */
static
const
EventLogWriter
*
getEventLogWriter
(
void
)
...
...
testsuite/tests/programs/andy_cherry/Main.hs
View file @
e28fbbb7
...
...
@@ -27,7 +27,7 @@
let
(
style
,
fn
,
filename
)
=
interpArgs
(
words
"-d tex mygames.pgn"
)
file
<-
readFile
(
test_dir
++
"/"
++
filename
)
std_in
<-
getContents
let
games
=
pgnParser
fn
file
-- parse rel
ave
nt pgn games
let
games
=
pgnParser
fn
file
-- parse rel
eva
nt pgn games
putStr
(
prog
style
std_in
games
)
{- OLD 1.2:
...
...
@@ -37,7 +37,7 @@
let (style,fn,filename) = interpArgs args in
readFile filename abort $ \ file ->
readChan stdin abort $ \ std_in ->
let games = pgnParser fn file -- parse rel
ave
nt pgn games
let games = pgnParser fn file -- parse rel
eva
nt pgn games
in
appendChan stdout (prog style std_in games) abort done
-}
...
...
testsuite/tests/typecheck/should_compile/tc146.hs
View file @
e28fbbb7
{-# LANGUAGE RankNTypes #-}
-- The interesting thi
gn
about this one is that
-- The interesting thi
ng
about this one is that
-- there's an unbound type variable of kind *->*
-- that the typechecker should default to some
-- arbitrary type.
...
...
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