| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Export `Traversable()` and `Foldable()` from Prelude | Herbert Valerio Riedel | 2014-09-15 | 1 | -0/+4 |
| | | | | | | | | | | | | | | | | | | | | | | | This exposes *only* the type-classes w/o any of their methods. This is the very first step for implementing BPP (see #9586), which already requires breaking up several import-cycles leading back to `Prelude`. Ideally, importing `Prelude` should be avoided in most `base` modules, as `Prelude` does not define any entities, but rather re-exports existing ones. Test Plan: validate passes Reviewers: ekmett, austin Reviewed By: ekmett, austin Subscribers: simonmar, ezyang, carter Differential Revision: https://phabricator.haskell.org/D209 GHC Trac Issues: #9586 | ||||
| * | Added comments to BooleanFormula to explain the expression simplifier. (#7633) | Twan van Laarhoven | 2013-10-15 | 1 | -3/+47 |
| | | |||||
| * | Implement checkable "minimal complete definitions" (#7633) | Twan van Laarhoven | 2013-09-18 | 1 | -0/+167 |
| This commit adds a `{-# MINIMAL #-}` pragma, which defines the possible minimal complete definitions for a class. The body of the pragma is a boolean formula of names. The old warning for missing methods is replaced with this new one. Note: The interface file format is changed to store the minimal complete definition. Authored-by: Twan van Laarhoven <twanvl@gmail.com> Signed-off-by: Herbert Valerio Riedel <hvr@gnu.org> | |||||
 |
index : delta/haskell.git | |
| gitlab.haskell.org: ghc/ghc.git |
| summaryrefslogtreecommitdiff |