Tag Archives: random

MonadRandom 0.5 released

Posted on January 3, 2017 by Brent

I’m happy to announce the release of MonadRandom-0.5, a package which provides a convenient monadic interface for random number generation in the style of transformers and mtl: a Rand monad (essentially a state monad that threads through a generator), a … Continue reading →

Posted in haskell, projects | Tagged , , | Leave a comment

MonadRandom 0.5 and mwc-random: feedback wanted

Posted on November 16, 2016 by Brent

Since 2013 or so I have been the maintainer of the MonadRandom package, which provides an mtl-style type class for monads with support for generation of pseudorandom values, along with a concrete random monad transformer RandT. As of this writing … Continue reading →

Posted in haskell, projects | Tagged , | 9 Comments

The generic-random library, part 1: simple generic Arbitrary instances

Posted on September 20, 2016 by Brent

(Note, 9/21/2017: The generic-random package has been changed and updated quite a bit since I wrote this post. For more up-to-date information, see e.g. the tutorial included with the package.) In a previous post I pointed out that we know … Continue reading →

Posted in combinatorics, haskell | Tagged , , , | 4 Comments

Boltzmann sampling for generic Arbitrary instances

Posted on March 23, 2016 by Brent

Update, 7/17/2017: this now exists; see https://byorgey.wordpress.com/2016/09/20/the-generic-random-library-part-1-simple-generic-arbitrary-instances/ . tl;dr: I know how to generate random instances of data types in a generic way, and even have some old code that already does all the hard work, but won’t have time … Continue reading →

Posted in combinatorics, haskell, math, species | Tagged , , , , , | 14 Comments

Monad transformers: a cautionary tale

Posted on April 29, 2013 by Brent

When writing the code in my previous post, I wanted to have a monad which combined the ability to generate random numbers with the ability to fail. Naturally, I decided to use RandT Maybe. But when I tried to write … Continue reading →

Posted in haskell | Tagged , , , | Leave a comment

Random binary trees with a size-limited critical Boltzmann sampler

Posted on April 25, 2013 by Brent

Today I’d like to talk about generating random trees. First, some imports and such (this post is literate Haskell). > {-# LANGUAGE GeneralizedNewtypeDeriving #-} > > module BoltzmannTrees where > > import Control.Applicative > import Control.Arrow ((&&&)) > import Control.Lens … Continue reading →

Posted in combinatorics, haskell, math, species | Tagged , , , , , | 14 Comments