Tree-Structured Concurrency II: Replacing Background Tasks With Actors

Structured concurrency (Tree-)Structured Concurrency is neat because it greatly simplifies concurrent programs. It greatly reduces, if not outright eliminates the possibility of logical races due to concurrency issues. And conceptually it’s not that hard either, as we can encode structured concurrency with just two rules: Every child computation (except the root) must have exactly one logical…