Rock Solid Haskell Services (Part 3)
summary
component M is a small Haskell library that guarantees cleanup of all resources, tracks init and teardown time per component, and builds a dependency graph to run initializers and teardowns in topological order. applicative composition spawns concurrent init threads; async exceptions are masked so partial allocations get cleaned up. demos wire a logger, a database pool and a migration component, use foreign-store for fast reloads, and show run/devel loops that report failures and cleanup — live coding includes a few hiccups but the cleanup reporting works.
AI-written summary · about
chapters (4)
related talks
37mBuilding Reactive Services Using Functional Programming
47mWhirlwind Tour of the Scala Functional Programming Ecosystem
12mSingletons and You in Haskell
51mPragmatism, Puritanism and Functional Programming
58mMonads in Chains
27mEffectful
39mA Lazy Scheme In Haskell
01h 12mAsynchronous and Concurrent Programming in Scala Part 3