I’ve been pouring a lot of effort into CodeWorld lately… and I wanted to write a sort of apology to the Haskell community. Well, perhaps not an apology, because I believe I did the right thing. 1,115 more words

## Tags » Haskell

#### Haskell Vectors and Sampling from a Categorical Distribution

# Introduction

Suppose we have a vector of weights which sum to 1.0 and we wish to sample n samples randomly according to these weights. There is a well known trick in… 479 more words

#### Importance Sampling

# Importance Sampling

Suppose we have an random variable with pdf and we wish to find its second moment numerically. However, the random-fu package does not support sampling from such as distribution. 836 more words

#### Performance: Looping

Before I finish off the Hungarian algorithm, I want to settle (nominally) the matter of performance with respect to array/vector based number-crunching in Haskell. 898 more words

#### SmartChecking Matt Might's Red-Black Trees

Matt Might gave a nice intro to QuickCheck via testing red-black trees recently. Of course, QuickCheck has been around for over a decade now, but it’s still useful (if underused–why aren’t… 552 more words

#### Access latest business systems (CRM, SharePoint, Exchange …) from Haskell

## Introduction

Can you imagine how to connect from some legacy system or exotic programming language to latest business software like Microsoft Dynamics CRM, Microsoft SharePoint, Microsoft Exchange and many others? 866 more words

#### Young Tableau: Row-insertion (Part II)

```
> import Control.Lens
> import Control.Monad
> import Control.Monad.State
> import Data.List
> import Test.QuickCheck
```

Having defined a Young Tableau, let’s consider one of the ways to construct it. 492 more words