24 May
2012
24 May
'12
2:32 a.m.
Benjamin Ylvisaker
The paper discusses implementations in Lua, C++ and C, but I think Haskell could be an awesome substrate for such a framework. Has anyone thought about this?
I'm not convinced this will be better than using STM - the critique against STM seems (as always) not to apply to implementations where transactional data are segregated by the type system. I'm not sure about the non-composability of retry and orElse that the authors refer to, anybody know? -k -- If I haven't seen further, it is by standing in the footprints of giants