Lightning Talks
summary
Six five- to ten‑minute demos: a workflow using GHC‑mod holes that shows Emacs keybindings, automatic case‑splits and type-driven completions that actually fill code; an argument for programming across the curriculum borrowing writing‑across ideas to teach code reading and reproducible research; a CRDT deep dive with ORSWOT / dotted version vectors and a Riak server‑side implementation showing how merges avoid coordination; an ARM Raspberry Pi table instrument built mostly in Haskell with Arduino C++ glue that works but has latency tradeoffs; trampolines and a state‑monad trick that make deep recursion stack‑safe; Haskell microservices running in production as static binaries with cabal, EKG monitoring and real deployment lessons.
AI-written summary · about
chapters (5)
- 0:00Start
- 34:15Use Tail Recursion with an accumulator
- 35:53Trampoline Monad to the rescue!
- 36:06What is a trampoline? (approximation)
- 37:46When does a trampoline fail? Whenever the bind is nested...
