urn-random: A package for updatable discrete distributions
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
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]
Properties
Versions | 0.1.0.0, 0.1.0.0 |
---|---|
Change log | None available |
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:12Z |
Modules
[Index]
Downloads
- urn-random-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees