Sciweavers

POPL
2007
ACM

Implementing deterministic declarative concurrency using sieves

15 years 27 days ago
Implementing deterministic declarative concurrency using sieves
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.
Sam Lindley
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2007
Where POPL
Authors Sam Lindley
Comments (0)