summaryrefslogtreecommitdiff
path: root/libraries/base/GHC/Base.lhs
Commit message (Expand)AuthorAgeFilesLines
* base: Manually unlit .lhs into .hs modulesHerbert Valerio Riedel2014-11-071-1230/+0
* Make getTag use a bang pattern instead of seqDavid Feuer2014-11-071-1/+1
* Improve Applicative definitionsDavid Feuer2014-11-071-21/+48
* Remove redundant "Minimal complete definition"-commentsHerbert Valerio Riedel2014-11-041-6/+0
* Fix lost Haddock annotation for `class Monad m`Herbert Valerio Riedel2014-11-041-7/+6
* Fusion rule for "foldr k z (x:build g)"David Feuer2014-10-011-0/+3
* Generalise `Control.Monad.{when,unless,guard}`Herbert Valerio Riedel2014-09-281-3/+3
* `M-x delete-trailing-whitespace` & `M-x untabify`Herbert Valerio Riedel2014-09-241-3/+3
* Move `mapM` and `sequence` to GHC.Base and break import-cyclesHerbert Valerio Riedel2014-09-211-0/+13
* Move Applicative/MonadPlus into GHC.BaseHerbert Valerio Riedel2014-09-181-0/+71
* Move `when` to GHC.BaseHerbert Valerio Riedel2014-09-181-0/+12
* Move (=<<) to GHC.BaseHerbert Valerio Riedel2014-09-181-0/+6
* Re-add SPECIALISE liftM* pragmas dropped in d94de87252d0feHerbert Valerio Riedel2014-09-171-0/+5
* Move `Maybe`-typedef into GHC.BaseHerbert Valerio Riedel2014-09-161-0/+54
* base: Add some notes about the default impl of '(>>)'Austin Seipp2014-09-151-1/+23
* base: Remove bunk default impl of (>>=)Austin Seipp2014-09-151-1/+0
* Move ($!) from Prelude into GHC.BaseHerbert Valerio Riedel2014-09-131-1/+5
* Make Applicative a superclass of MonadAustin Seipp2014-09-091-7/+251
* Catch two typosGabor Greif2014-06-121-2/+2
* Comments only explaining the imports for GHC.Integer, GHC.TupleSimon Peyton Jones2014-06-111-8/+32
* Forgot to amend before pushing...Joachim Breitner2014-06-101-1/+1
* Fire "map/coerce" only in phase 1Joachim Breitner2014-06-101-1/+1
* Remove misleading commentAustin Seipp2014-03-131-3/+0
* Add RULE for "map coerce = map" (#8767)Austin Seipp2014-03-131-0/+11
* Comments only, about the "RA" and "RL" nomenclature for shiftsSimon Peyton Jones2014-03-131-0/+4
* Revert "Add fmapCoerce to Functor class."Austin Seipp2013-09-251-3/+1
* Add fmapCoerce to Functor class.Austin Seipp2013-09-241-1/+3
* Remove obsolete pre-Haddock-2 `#hide` pragmasHerbert Valerio Riedel2013-09-231-1/+0
* Follow changes in comparison primops (see #6135)Jan Stolarek2013-09-181-22/+22
* Comparison primops return Int# (Fixes #6135)Jan Stolarek2013-08-141-4/+9
* Re-jig SOURCE importsSimon Peyton Jones2013-06-061-3/+3
* Worker/Wrapper and static argument transform for `until` so it can be inlinedDaniel Fischer2012-12-061-2/+4
* Remove trailing whitespace in GHC.BaseDaniel Fischer2012-12-061-24/+24
* Move lazy from GHC.Base to GHC.MagicIan Lynagh2012-11-131-11/+2
* Replace Rank2Types with RankNTypesSimon Peyton Jones2012-10-311-1/+1
* Comments onySimon Peyton Jones2012-08-131-2/+6
* Fix inline rule shadowing warningsPaolo Capriotti2012-07-251-0/+2
* Port more primop rules to PrelRules.Paolo Capriotti2012-07-251-13/+0
* Make numeric rules builtin.Paolo Capriotti2012-07-241-68/+0
* Move divInt#/modInt# to ghc-primIan Lynagh2012-06-191-21/+0
* Use Word literals directly, rather than converting Int literalsIan Lynagh2012-05-211-2/+2
* Remove some more specialise-Int codeIan Lynagh2012-05-211-11/+1
* Remove some unnecessary Int specialised valuesIan Lynagh2012-05-211-4/+1
* Move chr's definition into a new GHC.CharIan Lynagh2012-02-281-8/+0
* Define a divModInt function that only does 1 divisionIan Lynagh2012-02-141-0/+12
* Use the new quotRemInt# primopIan Lynagh2012-02-141-0/+5
* Moved the instances from Control.Monad.Instances to GHC.Base and Data.EitherBas van Dijk2012-01-131-0/+10
* Update base for new Safe Haskell designDavid Terei2011-10-251-0/+1
* Follow ghc-prim changesIan Lynagh2011-08-261-6/+4
* Add a missing implicit build dependencyIan Lynagh2011-07-241-0/+3