@InProceedings{stm05,
   author = {Tim Harris and Simon Marlow and Simon Peyton Jones and Maurice Herlihy},
   title = {Composable Memory Transactions},
   booktitle = {PPoPP'05: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
   year = {2005},
   month = {June},
   address = {Chicago, Illinois},
   abstract = {Writing concurrent programs is notoriously difficult, and is of
increasing practical importance.  A particular source of concern
is that even correctly-implemented concurrency abstractions cannot
be composed together to form larger abstractions.  In this paper
we present a new concurrency model, based on \emph{transactional memory},
that offers far richer composition.  All the usual benefits of transactional memory
are present (e.g. freedom from deadlock), but in addition we describe
new modular forms of \emph{blocking} and \emph{choice} that
have been inaccessible in earlier work.
},
   url = {http://www.haskell.org/~simonmar/papers/stm.pdf}
}