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]
Versions 0.1.0.0
Dependencies base (==4.9.*), deepseq (==1.4.*), haskell-src-meta (==0.6.*), integer-gmp (==1.0.0.*), MonadRandom (==0.4.*), QuickCheck (==2.8.*), template-haskell (==2.11.*), transformers (==0.5.*) [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 Fri Jul 14 20:16:30 UTC 2017
Distributions NixOS:0.1.0.0
Downloads 220 total (9 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-14 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for urn-random-0.1.0.0

[back to package description]

urn-random

A Haskell package for updatable discrete distributions