base-prelude

The most complete prelude formed solely from the "base" package

https://github.com/nikita-volkov/base-prelude

Version on this page:1.3
LTS Haskell 23.0:1.6.1.1
Stackage Nightly 2024-12-09:1.6.1.1
Latest on Hackage:1.6.1.1

See all snapshots base-prelude appears in

MIT licensed and maintained by Nikita Volkov
This version can be pinned in stack with:base-prelude-1.3@sha256:109d6e372f9a862427da9628d6c95171152cb5e8d10acaf411d37cdc5d588730,1412

Module documentation for 1.3

A library which aims to reexport all the non-conflicting and most general definitions from the "base" package. This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM.

This package will never have any dependencies other than "base".

Versioning policy

The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of "base". Therefore it's recommended for the users of "base-prelude" to specify the bounds of "base" as well.

Changes

1.3

  • Give preference to Semigroup definitions over Monoid

1.2

  • Replace the Foreign export with Foreign.Storable, Foreign.Ptr, Foreign.ForeignPtr, Foreign.StablePtr. It’s more conservative and way less likely to cause name collisions.

1.1

  • Export Foreign

1.0.1

  • Relaxed the “base” dependency

1

No changes.

0.2

  • Reexported Data.Bifunctor.

  • first and second are now (conditionally) exported from Data.Bifunctor, not Control.Arrow; note that if your version of base is lower than 4.8, first and second won’t be available at all.

0.1.21

  • Reexported printf and hPrintf from Text.Printf.

0.1.20

  • Reexported Numeric.

0.1.19

  • Avoided the clash between (&) and sortOn defined in the package and versions of these functions imported from base.

0.1.18

  • Added implementations of (&) and sortOn (normally not available in older versions of base).

0.1.17

  • Reexported Control.Monad.Fix.