{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:57Z","timestamp":1750307757493,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1145\/1378704.1378725","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"91-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Composable memory transactions"],"prefix":"10.1145","volume":"51","author":[{"given":"Tim","family":"Harris","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Marlow","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon Peyton","family":"Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328449"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1038"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1133983"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168903"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168900"},{"key":"e_1_2_1_6_1","unstructured":"Daume III H. Yet another Haskell tutorial http:\/\/www.cs.utah.edu\/~hal\/docs\/daurne02yaht.pdf 2006.  Daume III H. Yet another Haskell tutorial http:\/\/www.cs.utah.edu\/~hal\/docs\/daurne02yaht.pdf 2006."},{"key":"e_1_2_1_7_1","volume-title":"Transaction Processing: Concepts and Techniques","author":"Gray J.","year":"1992","unstructured":"Gray , J. , and Reuter , A . Transaction Processing: Concepts and Techniques . Morgan Kaufmann Publishers, Inc. 1992 . Gray, J., and Reuter, A. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers, Inc. 1992."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065952"},{"key":"e_1_2_1_10_1","volume-title":"TRANSACT'06: Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing","author":"Harris","year":"2006","unstructured":"Harris , \u00d2., and Peyton Jones , S. Transactional memory with data invariants . TRANSACT'06: Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing , June 2006 . Harris, \u00d2., and Peyton Jones, S. Transactional memory with data invariants. TRANSACT'06: Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing, June 2006."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872048"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123003"},{"key":"e_1_2_1_14_1","volume-title":"Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan &amp","author":"Larus J.","year":"2007","unstructured":"Larus , J. , and Rajwar , R . Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan &amp ; Claypool Publishers , 2007 . Larus, J., and Rajwar, R. Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan & Claypool Publishers, 2007."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2006.18"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328448"},{"key":"e_1_2_1_18_1","volume-title":"Marktoberdorf Summer School","author":"Peyton Jones S.","year":"2000","unstructured":"Peyton Jones , S. Tackling the awkward squad: Monadic input\/output, concurrency, exceptions, and foreign-language calls in Haskell. Engineering Theories of Software Construction , Marktoberdorf Summer School 2000 . Peyton Jones, S. Tackling the awkward squad: Monadic input\/output, concurrency, exceptions, and foreign-language calls in Haskell. Engineering Theories of Software Construction, Marktoberdorf Summer School 2000."},{"key":"e_1_2_1_19_1","volume-title":"Beautiful Code","author":"Peyton Jones S.","year":"2007","unstructured":"Peyton Jones , S. Beautiful concurrency . In Beautiful Code ( 2007 ), A. Oran and G. Wilson, Eds ., O'Reilly . Peyton Jones, S. Beautiful concurrency. In Beautiful Code (2007), A. Oran and G. Wilson, Eds., O'Reilly."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237794"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158524"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.54"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224987"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/88.260295"},{"key":"e_1_2_1_25_1","volume-title":"The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's J","author":"Sutter H.","year":"2005","unstructured":"Sutter , H. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's J .; March 2005 ). Sutter, H. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's J.; March 2005)."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378704.1378725","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378704.1378725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:25Z","timestamp":1750253965000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378704.1378725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1145\/1378704.1378725"],"URL":"https:\/\/doi.org\/10.1145\/1378704.1378725","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2008,8]]},"assertion":[{"value":"2008-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}