I've been waiting for a Haskell response to that STM article, because the STM article didn't pay any attention to Haskell at all. One criticism of the article fails in Haskell entirely (in Haskell, you don't get the problem of IO repeating if the transaction repeats, because you can't have IO in transactions (barring cheating)). I'd like to hear how their performance compares, and if it does have a lot of overhead, whether they think it'll ever come out.

The fact that there wasn't one leads me to believe that they are susceptible to the same problems and have no hope of getting around it in the future, though; I suspect if that wasn't true, dons would have been all over the comments on proggit, and he was silent. It's thin logic, admittedly, but...