urn-random: A package for updatable discrete distributions

[ data, library, mit ] [ Propose Tags ]

This package implements urns, which are a simple tree-based data structure that supports sampling from and updating discrete probability distributions in logarithmic time. The details are presented in the paper “Ode on a Random Urn (Functional Pearl)”, by Leonidas Lampropoulos, Antal Spector-Zabusky, and Kenneth Foner, published in Haskell Symposium ’17.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS]
Dependencies base (>=4.9 && <4.10), deepseq (>=1.4 && <1.5), haskell-src-meta (>=0.6 && <0.7), integer-gmp (>=1.0.0 && <1.0.1), MonadRandom (>=0.4 && <0.5), QuickCheck (>=2.8 && <2.9), template-haskell (>=2.11 && <2.12), transformers (>=0.5 && <0.6) [details]
License MIT
Copyright Copyright © 2016–2017 Leonidas Lampropoulos, Antal Spector-Zabusky, and Kenneth Foner
Author Leonidas Lampropoulos, Antal Spector-Zabusky, Kenneth Foner
Maintainer Antal Spector-Zabusky <antal.b.sz@gmail.com>
Category Data
Home page https://github.com/antalsz/urn-random
Source repo head: git clone https://github.com/antalsz/urn-random.git
Uploaded by AntalSpectorZabusky at 2017-07-14T20:16:30Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 972 total (10 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-14 [all 1 reports]

Readme for urn-random-

[back to package description]


A Haskell package for updatable discrete distributions