From HaskellWiki

Revision as of 10:18, 5 October 2007 (edit) Emk (Talk | contribs) (Described probability monad stuff) ← Previous diff		Revision as of 10:21, 5 October 2007 (edit) (undo) Emk (Talk | contribs) (Links to more resources) Next diff →
Line 14:		Line 14:
	== Probability monads ==		== Probability monads ==
		+
		+	A really cool existing implementation: [http://web.engr.oregonstate.edu/~erwig/pfp/ Probabilistic functional programming]
		+
		+	[http://www.randomhacks.net/articles/2007/10/02/probability-monads-at-hac-07-ii Darcs repository and draft paper].
	Things to work on:		Things to work on:

---

Revision as of 10:21, 5 October 2007

Contents 1 Generic Information 2 Active Projects 2.1 Cabal 2.2 ByteString network 2.3 Probability monads

1 Generic Information

How to create repositories...

2 Active Projects

Please feel free to describe your current project here!

2.1 Cabal

2.2 ByteString network

Change Network.* to use strict ByteStrings instead of Strings. It would also be nice to tidy up the #ifdef mess.

Current hacker(s): tibbe (Johan Tibell)

2.3 Probability monads

A really cool existing implementation: Probabilistic functional programming

Darcs repository and draft paper.

Things to work on:

1. Get MaybeT into Hackage.
2. Is WriterT really the right monad transformer? We want the join and bind operations, but not the rest of the MonadWriter type class.
3. Should probabilities be represented as floats, fractions or a type class?
4. Can this run fast enough to be useful?

Current hacker(s): ekidd (Eric Kidd)