Recursion

What you'll learn

• 01 Haskell GHC internals, profiling, and effect systems. Several of these talks are about running Haskell in production rather than writing it. ghc laziness effects profiling -- fixed points, laziness, and the cost of both fix :: (a -> a) -> a fix f = let x = f x in x
• 02 OCaml Multicore, effect handlers, and what the module system is good for beyond namespacing. multicore effects functors flambda (* effects, modules, and a compiler that finishes *) let rec fix f x = f (fix f) x
• 03 Types & proofs Rocq, Lean, Agda, and which properties are worth proving, and which are cheaper to test. lean rocq agda refinement -- proofs that survive a refactor theorem fold_append : forall xs ys, fold (xs ++ ys) = fold xs <> fold ys
• 04 Compilers & runtimes Intermediate representations, closure conversion, inlining decisions, and garbage collectors under sustained load. anf gc jit inlining -- what the allocator does at 3 a.m. data Value = Closure Env Term | Thunk (IO Value)
• 05 Practice Hiring, onboarding, migrations, and incident reviews from teams running functional code. production hiring incidents migration -- functional programs that hold a pager type Handler = Request -> IO Response

Topics covered