You're describing (safe) locking of resources, best put forward by Dijkstra in 1965 as the Dining Philosophers problem. I have yet to see a more practical, ele

You're describing (safe) locking of resources, best put forward by Dijkstra in 1965 as the Dining Philosophers problem. I have yet to see a more practical, elegant solution than Haskell's STM for this: https://www.adit.io/posts/2013-05-15-Locks,-Actors,-And-STM-In-Pictures.html https://www.adit.io/posts/2013-05-15-Locks,-Actors,-And-STM-...