- 07 Nov, 2014 6 commits
-
-
zudov authored
Summary: Some of the links in user's guide were broken, I've found the files they used to link and updated urls. Reviewers: austin Reviewed By: austin Subscribers: thomie, carter, simonmar Differential Revision: https://phabricator.haskell.org/D418
-
rodlogic authored
Summary: The last three '#define ...' macros were removed from Parser.y.pp and this file was renamed to Parser.y. This basically got rid of a CPP step in the build. Also converted two modules in compiler/parser/ from .lhs to .hs. Test Plan: Does it build? Yes, I performed a full build here and things are looking good. Reviewers: austin Reviewed By: austin Subscribers: adamse, thomie, carter, simonmar Differential Revision: https://phabricator.haskell.org/D411
-
Merijn Verstraaten authored
Summary: My previous attempt to fix the new coercion bug introduced by my fix actually just reverted back to the *old* bug. This time it should properly handle all three size scenarios. Signed-off-by:
Merijn Verstraaten <merijn@inconsistent.nl> Test Plan: validate Reviewers: dfeuer, austin, hvr Reviewed By: austin, hvr Subscribers: thomie, carter, simonmar Differential Revision: https://phabricator.haskell.org/D407 GHC Trac Issues: #8089
-
Austin Seipp authored
Signed-off-by:
Austin Seipp <austin@well-typed.com>
-
David Feuer authored
It's prettier that way, and there's less risk of anything going sideways. Reviewed By: hvr, simonpj Differential Revision: https://phabricator.haskell.org/D450
-
David Feuer authored
Generally clean up things relating to Applicative and Monad in `GHC.Base` and `Control.Applicative` to make `Applicative` feel like a bit more of a first-class citizen rather than just playing second fiddle to `Monad`. Use `coerce` and GND to improve performance and clarity. Change the default definition of `(*>)` to use `(<$)`, in case the `Functor` instance optimizes that. Moreover, some manually written instances are made into compiler-derived instances. Finally, this also adds a few AMP-related laws to the `Applicative` docstring. NOTE: These changes result in a 13% decrease in allocation for T9020 Reviewed By: ekmett, hvr Differential Revision: https://phabricator.haskell.org/D432
-
- 06 Nov, 2014 19 commits
-
-
David Terei authored
-XIncoherentInstances turned on.
-
David Terei authored
-
David Terei authored
Haskell.
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
The main description is in Note [Preventing recursive dictionaries] in TcRnTypes, which applies only to Coercible dictionaries. But it was a bit of a mess: - It wasn't applied consistently - It was being applied to non-Coercible dictionaries in some places This patch tidies it up. This hack will largely go away when Richard starts treating Coercible constraints more like equalities than like dictionaries.
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
See Note [Propagate solved dictionaries] in TcSMonad. This can signficantly reduce the number of solver steps.
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
See Note [Lazy flattening] in TcFlatten. Lazy flattening was an apparently good idea which actually made the type inference engine go a LOTS slower in T3064. So I switched it off again.
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
A little refactoring
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
This improves error messages when there is a type error, fixing Trac #9774
-
Jan Stolarek authored
-
Jan Stolarek authored
-
Jan Stolarek authored
-
Jan Stolarek authored
-
mjo authored
Add doctest examples for every data type and function in `Data.Either` Differential Revision: https://phabricator.haskell.org/D443
-
- 05 Nov, 2014 10 commits
-
-
Simon Marlow authored
-
Simon Marlow authored
-
Simon Marlow authored
-
Simon Marlow authored
-
Simon Marlow authored
1. The offset was a full word, but it should actually be a 32-bit offset on 64-bit platforms. 2. The con_desc string was allocated separately, which meant that it might be out of range for a 32-bit offset. These bugs meant that +RTS -Di (interpreter debugging) would sometimes crash on 64-bit.
-
Herbert Valerio Riedel authored
This is introduced in aa479953 and would cause indeterministic testsuite failures in `sigof02dmt`
-
bernalex authored
Niklas Hambüchen suggested that we add the dual of `subsequences`, isSubsequenceOf (like `isPrefixOf` to `inits` & `isSuffixOf` to `tails`). It was a simple and noncontroversial proposal which passed unanimously. For more details see the original proposal discussion at https://www.haskell.org/pipermail/libraries/2014-November/024063.html Differential Revision: https://phabricator.haskell.org/D435Signed-off-by:
Alexander Berntsen <alexander@plaimi.net>
-
Herbert Valerio Riedel authored
This mostly cleans up irregularities introduced in 68255588 (re D352) as well as making sure Haddock is able to resolve all references.
-
David Feuer authored
New `Foldable` methods accidentally had `Foldable` contexts, which led to type roles being assigned incorrectly and preventing GND from deriving `Foldable` instances. Removing those fixes #9761. Moreover, this patch takes advantage of this fix by deriving `Foldable` (and `Eq`) for `UniqFM`. Differential Revision: https://phabricator.haskell.org/D425
-
Herbert Valerio Riedel authored
This disables T3064 temporarily as it puts a strain on buildbots during validation exhausting all available memory.
-
- 04 Nov, 2014 5 commits
-
-
Simon Peyton Jones authored
Plus adding comments. The most substantive change is that PendingTcSplice becomes a proper data type rather than a pair; and PendingRnSplice uses it
-
Herbert Valerio Riedel authored
-
Herbert Valerio Riedel authored
Those manual descriptions in Haddock strings have become redundant since Haddock gained the ability to print the minimal complete definition as specified via `{-# MINIMAL #-}` annotation (or otherwise inferred by GHC). Moreover, this commit moves all `{-# MINIMAL #-}` annotations in `base` to the start of the respective `class` definitions, as this is more readable and matches more closely the way Haddock renders that information.
-
Simon Peyton Jones authored
-
Simon Peyton Jones authored
-