Cloud nano-bots: Strongly-Typed State Machines In The Cloud
summary
Demonstrates a small DSL that declaratively specifies state machines and generates strongly typed C# Orleans grains so illegal transitions are impossible at compile time. Shows a four‑state bank account example, a generated grain of about 506 lines of code, and notes a single union case costs ~45 lines if handwritten. Uses an F# DSL, a Visual Studio extension plus NuGet/GitHub tooling to emit union/restriction types, cut boilerplate, remove many tests, and keep single‑threaded Orleans semantics for safe, scalable stateful actors.
AI-written summary · about
chapters (17)
- 0:00Start
- 1:21The lifecycle of a BLOBA
- 5:57The state of entropy
- 7:43What does better look like?
- 9:01Let's Build A Bank
- 10:22Initialize
- 10:47Deposit
- 11:26The Winds of Change
- 12:37CR 1: Close
- 14:33Where's all this pain coming from
- 19:24Affordance vs Capability
- 21:26Digression
- 23:53Union Types for CH
- 24:51Shape Shifting Objects
- 26:47What have we done?
- 30:57Orleans on a slide
- 43:51Acknowledgements
related talks
32mDAVID KHOURSHID Making state management intelligent
49mPushing LLMs over the Edge: Exploring the Limits of the Possible
31mThe Future Is Domain-Specific Agents
01h 03mAgents Everywhere
09h 28mDay 2
30mConversational Computing: How Okasaki proved McCarthy right again
01h 03mMicrosoft Q# and Azure Quantum
46mClaude AI is not intelligent | Stochastic Architecture