I want to implement a dynamic programming algorithm polymorphic in the score type; here's a simplified 1D version with no boundary conditions: {-# LANGUAGE ConstraintKinds, FlexibleContexts, RankN...

I'm working on a sorting library for MArrays. Speed is important, so I want to optimize it as much as possible. Currently, I simply INLINE the sorting functions. This speeds up the code more than ...

let's say I've got the following type : data MyType = Constructor0 | Constructor1 | Constructor2 deriving (Eq,Show,Enum) Is there a way to create one of such instances : MArray (STUArray s) My...