Difference between revisions of "Probabilistic Functional Programming"
(bibliography by Mark Dominus) 
(darcs.haskell.org > code.haskell.org) 

Line 12:  Line 12:  
* http://hackage.haskell.org/cgibin/hackagescripts/package/probability 
* http://hackage.haskell.org/cgibin/hackagescripts/package/probability 

−  * <code>darcs get http:// 
+  * <code>darcs get http://code.haskell.org/~thielema/probability/</code> 
== Future == 
== Future == 
Revision as of 14:08, 26 January 2010
Probabilistic functional programming is a library for discrete random variables in terms of their distribution. A distribution represent the outcome of a probabilistic event as a collection of all possible values, tagged with their likelihood. It turns out that random variables establish a monad, namely a list monad where all items are equipped with a probability. A nice aspect of this system is that simulations can be specified independently from their method of execution. That is, we can either fully simulate or randomize any simulation without altering the code which defines it. 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/cgibin/hackagescripts/package/probability

darcs get http://code.haskell.org/~thielema/probability/
Future
Currently it is annoying that the distribution monad is not able to accumulate the probabilities of equal elements automatically. Thus you must make this manually, whenever you feel that it is necessary. This is due to a restriction of the monad class, that does not allow restrictions of the types of the monadic result. However using the RMonad we could implement the desired functionality.