Sampling function-based probability distributions.

Version on this page:2.0.4@rev:1
LTS Haskell 22.25:2.3.1
Stackage Nightly 2024-06-16:2.3.1
Latest on Hackage:2.3.1

See all snapshots mwc-probability appears in

MIT licensed by Jared Tobin, Marco Zocca
Maintained by [email protected], zocca.marco gmail
This version can be pinned in stack with:mwc-probability-2.0.4@sha256:66165ec2a6f47ca2bb0fa5e57e7534fd0374150e4c16fbfe935f83de675f9cac,1918

Module documentation for 2.0.4


Build Status Hackage Version MIT License

Sampling function-based probability distributions.

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.


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

    -- uniform over [0, 1] transformed to uniform over [1, 2]
    succ <$> uniform
  • Sequence distributions together using bind:

    -- a beta-binomial composite 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

Check out the haddock-generated docs on Hackage for other examples.


PRs and issues welcome.