Probabilistic Functional Programming
From HaskellWiki
(Difference between revisions)
m (Probability moved to Probabilistic Functional Programming) |
(more links) |
||
| Line 3: | Line 3: | ||
* Erwig and Kollmansberger: [http://web.engr.oregonstate.edu/~erwig/papers/PFP_JFP06.pdf Probabilistic Functional Programming] | * Erwig and Kollmansberger: [http://web.engr.oregonstate.edu/~erwig/papers/PFP_JFP06.pdf Probabilistic Functional Programming] | ||
| + | * http://eecs.oregonstate.edu/~erwig/pfp/ | ||
| + | |||
| + | Version maintained by Henning Thielemann: | ||
| + | |||
* http://hackage.haskell.org/cgi-bin/hackage-scripts/package/probability | * http://hackage.haskell.org/cgi-bin/hackage-scripts/package/probability | ||
| + | * <code>darcs get http://darcs.haskell.org/probability/</code> | ||
== See also == | == See also == | ||
Revision as of 23:38, 14 February 2009
Probabilistic functional programming is a library for discrete random variables in terms of their distribution. Examples include dice games, the Monty Hall paradoxon and others.
- Erwig and Kollmansberger: Probabilistic Functional Programming
- http://eecs.oregonstate.edu/~erwig/pfp/
Version maintained by Henning Thielemann:
- http://hackage.haskell.org/cgi-bin/hackage-scripts/package/probability
-
darcs get http://darcs.haskell.org/probability/
