Tom Pledger wrote: > For two threads to have access to the same MVar, they must have a > common ancestor, right? Could a common ancestor spawn a transaction > broker thread? That would be similar to what database management > systems do. It'd still be centralised, but wouldn't need to do unsafe > IO. Well, all threads trivially have a common ancestor. But I don't see how you can pick a particular ancestor. The flags could easily have been passed around in a fairly general fashion along polymorphic channels.
- RE: Trivial Haskell Concurrency problem Simon Peyton-Jones
- Re: Trivial Haskell Concurrency problem Wolfram Kahl
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem Michael Hobbs
- Re: Trivial Haskell Concurrency problem Marcin 'Qrczak' Kowalczyk
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem Tom Pledger
- Re: Trivial Haskell Concurrency problem Marcin 'Qrczak' Kowalczyk
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem Tom Pledger
- Re: Trivial Haskell Concurrency problem Marcin 'Qrczak' Kowalczyk
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem George Russell
- Re: Trivial Haskell Concurrency problem George Russell