Concurrent Haskell

http://citeseer.ist.psu.edu/jones96concurrent.html full paper at http://research.microsoft.com/Users/simonpj/Papers/papers.html This paper needs more examples. How do you: write a fork bomb? do symmetric forks (symFork)? do lazy-list communications? non-deterministic join? non-deterministic split? wait for the termination of a process? kill another process? what are the types of getChan and putChan? what is unGetChan supposed to do? Where's the "full version" of the paper as referred to in Section 4. There it is: http://research.microsoft.com/Users/simonpj/Papers/papers.html In any instance of takeMVar foo >> putMVar foo (e.g., figure 2), what if the actions aren't atomic? example of priority? I really don't "get" this "singular choice" thing.