Linked by Thom Holwerda on Thu 16th Aug 2007 17:24 UTC, submitted by burnttoy
Permalink for comment 264229
To read all comments associated with this story, please click here.
To read all comments associated with this story, please click here.





Member since:
2006-03-01
Pure functional languages are very easy to parallelize. So if you want a language where you do not have to explicitly define threads, any functional language such as ocaml, clean or haskell will do just fine.
But in this case "transparent" just means that the transaction implementation will switch seamlessly from fast hardware transactions to software transactions when the transaction gets too big for the hardware cache. So the developer does not have to be aware of the limitations of the hardware transactional memory implementation.
Edited 2007-08-17 19:19