I don’t know of any. Quite a bit has been done for the single threaded case, trying to identify cases where thunk updates can be omitted (e.g. http://research.microsoft.com/%7Esimonpj/Papers/usage-types/usage.htm). For the parallel case you may be interested in our Haskell workshop paper (on my home page). Simon | -----Original Message----- | From: haskell-bounces@haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of John Meacham | Sent: 12 August 2005 04:05 | To: haskell@haskell.org | Subject: [Haskell] concurrency analysis | | I was curious if there has been any research on "concurrency analysis" | which would determine which thunks might be accessed concurrently by | different threads. I imagine that the vast majority are only accessed in | a single threaded manner so can use a more efficient representation when | doing SMP parallelism with haskell. It seems that some sort of abstract | interpretation could provide a conservative answer to this similar to | the way update analysis is done. | John | | | -- | John Meacham - ⑆repetae.net⑆john⑈ | _______________________________________________ | Haskell mailing list | Haskell@haskell.org | http://www.haskell.org/mailman/listinfo/haskell