Transient: Unrestricted Algebraic and Monadic Composability
summary
Claims a set of concrete Haskell primitives that make effects composable across events, blocking I/O and distributed nodes and demonstrates them with live demos (IRC client, MapReduce across browser and server). Uses waitEvents/whiteEvents and applicative/monoid combinators to mix async and sync, a teleport/lock pair to replicate closures and resume remote computation, and a thread-limiting primitive to handle thousands of logical tasks without spawning thousands of OS threads; demos run end to end.
AI-written summary · about
chapters (24)
- 0:00Algebraic composability intro
- 2:05Recipes as sequential steps
- 5:21Boxes for isolated concurrency
- 8:11Pure processing to blocking I/O
- 10:43OOP and async messaging
- 13:32Monadic continuation need
- 16:56Blocking I/O with white evans
- 20:42Monadic event composability
- 24:34Applicative/monoid concurrency
- 27:40Reactive formulas
- 30:17Monitor primitives for events
- 33:23Thread control with white evans
- 36:49State in monitor system
- 38:24Channels for branches
- 40:59Thread leveling primitives
- 43:37Error handling with backtracking
- 47:33Continuations for recovery
- 49:03Remote execution via teleport
- 52:54Web routes and program nav
- 55:56Streaming services
- 57:19MapReduce remote apps
- 59:40MapReduce live demo
- 1:02:07Interactive demo
- 1:05:15Q&A
related talks
01h 04mHaskell - A Peek Inside the Ivory Tower
01h 10mA History of Effect Systems
01h 00mCause and Effect(s): Towards a More Programmable Haskell
46mPainless software development with Haskell
43mMesh
01h 22mHaskell for Everyday Programmers
47mReactors Road to Composable Distributed Computing
20mEfficient, Portable, Census-Polymorphic Choreographic Programming