It's too easy to tease, but I will try to resist.
But, seriously, they've been talking about this GPU work for upwards of a 1.5 years now. Usually we get something to play with, even if it's pretty badly broken (I'm thinking NDP here), so the lack of code here is pretty atypical. The accelerate link above is news to me, though, so that's helpful. Hope to see more soon!
* EDIT (to back up my 1.5 years claim):
earliest mention, May 15, 2008: http://www.cs.chalmers.se/Cs/Grundutb/Kurser/svh/Slides/may-...
Chak's own work, Jan 10, 2009: http://www.citeulike.org/user/iff/article/3872848 http://www.cse.unsw.edu.au/~chak/papers/LCGK09.html
and, of course, accelerate ("reference implementation") was only released Aug 17, 2009: http://hackage.haskell.org/package/accelerate
Re:Haskell Arrays Accelerated with GPUs
by DannoHung on Friday September 11, 2009 @11:35AM
(#817513)
I think it's because of overexposure to category theory. It gets to the point where they see a name, the see a type signature, they assume the developer isn't pathological, and figure out what they need.
(Haskell guys, I love ya, but you have some of the oddest blind spots sometimes.)