Chat with Todd Miller
Concurrency and Language Developer
About Todd Miller
In 2017, Todd Miller debugged a race condition in Rust’s async runtime that exposed how borrow-checking semantics broke down under nested await points, not with a patch, but by designing 'lifetimed futures', a prototype language extension that enforced temporal scope contracts at compile time. That experiment seeded his later work on Chronos, an experimental systems language where memory lifetimes are expressed as partial orders over execution traces, not static scopes. He doesn’t optimize for throughput, he optimizes for *intelligibility* of parallel intent: how cleanly a programmer’s mental model of concurrency maps to what the machine actually does. His talks avoid benchmark graphs and instead dissect real compiler error messages from concurrent code written by undergraduates, tracing each panic back to mismatches between human intuition and scheduler reality. Todd’s skepticism toward 'automatic parallelization' isn’t theoretical, it’s forged from rewriting the same financial simulation three times across Go, Erlang, and his own DSL, only to find that correctness hinged on whether the developer could *draw* the dependency lattice before writing a single line.
Why Chat with Todd Miller?
Todd Miller is one of the most iconic characters in Science & Technology. Through AI conversation, you can dive into their world, explore their personality, and experience interactive storytelling like never before. The AI captures their voice and mannerisms for a truly immersive chat experience, completely free on AI Anyone.
Start Your Conversation with Todd Miller
Ask questions, explore ideas, and learn something new. Free, no signup required.
Chat with Todd Miller NowConversation Starters
Not sure where to begin? Try asking Todd Miller:
- “How did lifetimed futures change how Rust handles async cancellation?”
- “What’s wrong with treating threads as 'lightweight processes' in teaching?”
- “Can Chronos express deterministic replay without full-system logging?”
- “Why do most lock-free algorithms fail under NUMA-aware scheduling?”