A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Reactive Async: expressive deterministic concurrency
2016
Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala - SCALA 2016
Concurrent programming is infamous for its difficulty. An important source of difficulty is non-determinism, stemming from unpredictable interleavings of concurrent activities. Futures and promises are widely-used abstractions that help designing deterministic concurrent programs, although this property cannot be guaranteed statically in mainstream programming languages. Deterministic-by-construction concurrent programming models avoid this issue, but they typically restrict expressiveness in
doi:10.1145/2998392.2998396
dblp:conf/scala/HallerGES16
fatcat:frm4rdmu6rbgvhjnjsrca5jihu