- 01 - The Course Overview.mp415.76 MiB
- 02 - Installation and Setup.mp416.85 MiB
- 03 - IO as a -Sin Bin-.mp452.02 MiB
- 04 - Exception Handling.mp434.58 MiB
- 05 - Fewer Sins Using the Free Monad.mp447.95 MiB
- 06 - Benign Side-Effects Using unsafePerformIO.mp424.14 MiB
- 07 - Simple Streaming Using Lazy IO.mp432.12 MiB
- 08 - Pure Streaming Using Lazy Lists.mp428.50 MiB
- 09 - Composing Finite and Infinite Streams.mp435.67 MiB
- 10 - Who's Driving - Push, Pull… or Both!.mp435.41 MiB
- 11 - Transforming Effectful Streams Using the Free Monad.mp428.98 MiB
- 12 - Events, Behaviors, and Signals.mp428.23 MiB
- 13 - Local and Global States.mp431.39 MiB
- 14 - Higher-Order Signals and Time Leaks.mp446.15 MiB
- 15 - Pure, Monadic, and Arrowized APIs.mp447.09 MiB
- 16 - Continuous, Synchronous, Total Time.mp445.57 MiB
- 17 - Parallel and Concurrent Algorithms.mp441.73 MiB
- 18 - Manual Parallelism Using the Free Applicative.mp439.77 MiB
- 19 - Laziness and Parallelism.mp432.20 MiB
- 20 - Purity and Parallelism.mp449.94 MiB
- 21 - Deterministic Communication Using IVars.mp448.72 MiB
- 22 - Deterministic Collaboration Using LVars.mp437.09 MiB
- 23 - Manual Concurrency Using forkIO.mp417.16 MiB
- 24 - Taming Asynchronous APIs Using ContT.mp443.03 MiB
- 25 - Opportunistic Concurrency Using Async.mp418.59 MiB
- 26 - Laziness and Concurrency.mp430.86 MiB
- 27 - Manual Signaling Using MVars.mp435.20 MiB
- 28 - Automatic Signaling Using TVars.mp446.59 MiB
- 29 - Effect Tracking and Concurrency.mp438.20 MiB
- 30 - Combinator Libraries.mp441.15 MiB
- 31 - Monad Transformers.mp438.32 MiB
- 32 - Nesting Architectures.mp433.52 MiB
- 33 - Precise Types, Program Boundaries, and Microservices.mp430.64 MiB
- 34 - Optimizing Microservice Requests Using Haxl.mp428.55 MiB
- 35 - Distributed Concurrent Programming Using Cloud Haskell.mp431.26 MiB
- 36 - CRDTs, Type Class Laws, and Eventual Consistency.mp445.93 MiB