mwc-probability

Sampling function-based probability distributions.

http://github.com/jtobin/mwc-probability

Version on this page:	1.0.3
LTS Haskell 24.25:	2.3.1
Stackage Nightly 2025-12-25:	2.3.1
Latest on Hackage:	2.3.1

See all snapshots mwc-probability appears in

MIT licensed by Jared Tobin

Maintained by [email protected]

This version can be pinned in stack with:mwc-probability-1.0.3@sha256:6a53b8a565ebcdc7851e1f47c02fc325620a3385b60a872e0b3c95e5b7dea1b1,1684

Module documentation for 1.0.3

System
- System.Random
  - System.Random.MWC
    - System.Random.MWC.Probability

Depends on 4 packages(full list with versions):

base, mwc-random, primitive, transformers

Used by 5 packages in nightly-2016-02-11(full list with versions):

declarative, hasty-hamiltonian, mcmc-types, mighty-metropolis, speedy-slice

A simple probability distribution type, where distributions are characterized by sampling functions.

This implementation is a thin layer over mwc-random, which handles RNG state-passing automatically by using a PrimMonad like IO or ST s under the hood.

Includes Functor, Applicative, Monad, and MonadTrans instances.

Examples

Transform a distribution's support while leaving its density structure invariant:

-- uniform over [0, 1] to uniform over [1, 2]
succ <$> uniform

Sequence distributions together using bind:

-- a beta-binomial conjugate distribution
beta 1 10 >>= binomial 10

Use do-notation to build complex joint distributions from composable, local conditionals:

hierarchicalModel = do
  [c, d, e, f] <- replicateM 4 $ uniformR (1, 10)
  a <- gamma c d
  b <- gamma e f
  p <- beta a b
  n <- uniformR (5, 10)
  binomial n p