Difference between revisions of "Talk:SantaClausProblem"

From HaskellWiki
Jump to navigation Jump to search
 
Line 3: Line 3:
 
I am writing a chapter for a book called "Beautiful code", edited by Greg Wilson. My [http://research.microsoft.com/~simonpj/tmp/beautiful.ps draft chapter] is about Software Transactional Memory in Haskell.
 
I am writing a chapter for a book called "Beautiful code", edited by Greg Wilson. My [http://research.microsoft.com/~simonpj/tmp/beautiful.ps draft chapter] is about Software Transactional Memory in Haskell.
   
I would welcome any comments or qusetions you have on the paper, or suggestions for improving it; the more concrete the better. You can email me directly (simonpj@microsoft.com), or add Wiki talk notes below.
+
I would welcome any comments or questions you have on the paper, or constructive suggestions for improving it; the more concrete the better.
  +
  +
The book is aimed at a general audience of programmers, <em>not</em> Haskell geeks, so I have tried to explain everything necessary as I go along. So if you are not a Haskell expert, your input would be particularly valuable to me.
  +
  +
You can email me directly (simonpj@microsoft.com), or add Wiki talk notes below.
   
 
----------
 
----------

Revision as of 14:32, 22 December 2006

Beautiful concurrency

I am writing a chapter for a book called "Beautiful code", edited by Greg Wilson. My draft chapter is about Software Transactional Memory in Haskell.

I would welcome any comments or questions you have on the paper, or constructive suggestions for improving it; the more concrete the better.

The book is aimed at a general audience of programmers, not Haskell geeks, so I have tried to explain everything necessary as I go along. So if you are not a Haskell expert, your input would be particularly valuable to me.

You can email me directly (simonpj@microsoft.com), or add Wiki talk notes below.


Simonpj 14:26, 22 December 2006 (UTC) To add a note, begin with four tilde signs ~~~~; the Wiki will fill in your user name and date.