Last week we submitted a paper to ICFP about how to implement efficient parallel stencil convolutions in Haskell. This goes along with a new release of Repa that runs on GHC 7.0.3. We've extended the old array representation to support the partitioning of arrays into several regions, and rewritten the back-end to recover sharing between the computation of adjacent array elements. Coupled with a ca
![Real Time Edge Detection in Haskell](https://cdn-ak-scissors.b.st-hatena.com/image/square/1787871c1a0afa47f200b4463f86deda586e3eb9/height=288;version=1;width=512/https%3A%2F%2Fblogger.googleusercontent.com%2Fimg%2Fb%2FR29vZ2xl%2FAVvXsEiM6pW99OkqkaiX7oPyzBKiv_dVybU0xJnMFXQ_LYF-CQ1x8Ve8NxEBN5UHZNgOkP8C6m4KgcaHtO9HOwPKL-TpFHkxJjsFecWtl0fr2UuAgBCy6NKZRyeGG_FfjPzDXEBBuJXHo5s43M2_%2Fw1200-h630-p-k-no-nu%2Fbeholder.jpg)