Gerd Stolpmann skrev:
This is simply nonsense. Different concurrency techniques
have different problems.
True.
For example, in event
handling-based concurrency you do not need locks, hence
you cannot run into deadlocks.
Yes you can. We've even had to write design rules to this
effect to
[Veuillez nous excuser pour les réceptions multiples éventuelles.
N'hésitez pas à diffuser largement cet appel.]
-- -- -
Technique et Science Informatiques (TSI)
Appel à propositions d'articles sur le
IIRC, there are already type systems which may prevent deadlocks in
pi-calculus. And since pi-calculus is essentially the base for
CML/OCaml's Event/lwt (I'm not 100% sure for lwt), my guess is that it
shouldn't be too hard to get them to work for purely functional threaded
code. The missing step
