Declarative Concurrency With ZIO STM
summary
Claims a stack-safe for arbitrary-length transactions STM implemented in ZIO with a mutable journal and primitives like TMap TQueue TPromise TSemaphore, shows concrete code: an Alice/Bob transfer that ends with Alice $700 Bob $10,000, a priority queue and dining philosophers solved with STM checks and retries, and explains the atomically/commit boundary between STM and Z worlds. Reports real speedups — roughly 20x to 100x faster on some ops — and the implementations work.
AI-written summary · about
chapters (7)
- 0:00Start
- 4:09learning curve
- 8:57SOFTWARE TRANSACTIONAL MEMORY
- 14:58HELLO, WORLD!
- 25:08BUILDING BLOCKS
- 41:32DATA STRUCTURES
- 45:54SUPERPOWERS
related talks
31mReal World ZIO
55mUnwrapping IO: is it a path that you want to follow?
01h 28mAsynchronous and Concurrent Programming in Scala Part 1
52mComparing Approaches to Structured Concurrency
01h 12mAsynchronous and Concurrent Programming in Scala Part 3
45mZIO: Next-Generation Effects in Scala
01h 53mAsynchronous and Concurrent Programming in Scala Part 2
15mPolyjuice: High-Performance Transactions via Learned Concurrency Control