In this release:

• Examples of using the `RandProc` library to work problems from `Random Processes` text have been added.
• `README` file has been fleshed out a bit.

Changes in this release:

• Improved several severe performance bottlenecks. (The `goodDie` space can now actually be checked, without exhausting memory/time.)
• Cleaned up the code, as per `hlint` suggestions.

Disclaimer) I am a complete newbie to not only Haskell, but functional programming in general. So, the code is most probably crap. However, I am extremely enthused about the topic, and willing (nay, anxious) to improve upon it, given the requisite criticism, feedback, encouragement, advice, etc.. Thanks, in advance!

Back story) About 2 years ago, I started going back through my graduate stochastic processes text, because I realized that I’d forgotten too much. About 6 months later, I got turned on to Haskell by some folks at work (a semiconductor start-up that was actually using Haskell to describe the new chip’s architecture; cool!) I went out and bought Graham Hutton’s book, and couldn’t put it down. I was carving out every minute I could to read the chapters and work through the problems. Then, about 6 months in, I realized, “Shit! I haven’t looked at my random processes book in 6 months!” Wife and family would never tolerate more distraction. So, I had to combine the 2. The `RandProc` library is the result of that combination. I plan to use it as an aid in working the problems in my random processes book, hoping that such practical pressure will polish it properly.

Invitation) If you’re still reading, please, contact me! I’d love for this to be a collaborative affair. In particular, in searching for previous related work on Hackage, I suspect a strong symbiosis between `RandProc` and `Probabilistic Functional Programming`. Might you know of others?