Concurrency

The hardest bugs you'll write live here. These lectures make interleavings, happens-before, and shared state visible — so correctness is something you can reason about, not hope for.

In preparation

Lectures on goroutines & channels, locks vs. message passing, data races and the race detector, and deadlock are being prepared. They follow the same structure as the Algorithms lectures and are published by the prof-helper agent.