An Effectively Ω(c) Language and Runtime
summary
Claims a language and runtime that are effectively Ω(c): constant-time operations, fixed memory overhead, and a GC that does constant work per allocation with a small bounded pause. Implements an immutable, no-cycles, no loops, deterministic surface; uses persistent structures (RRB vectors) to avoid hash-table and regex tail cases. Memory uses a bump-pointer young heap + ref-counted old space so collection needs no remembered sets or cycle collector, yielding realtime-like bounded pauses proportional to young-gen size. Code and regex engine are on GitHub.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:50Tail latency in software
- 3:57Reliability problems behind latency
- 4:59Language for reliability
- 7:26Deterministic data structures
- 9:10Generational collection
- 11:41Simplicity for reliability
- 13:29Q&A
related talks
26mAn Invitation to OCaml
15mEfficient Compilation of Algebraic Effect Handlers
58mC++, Abstract Algebra and Practical Applications
46mAhead Of Time (AOT) Internals
21mGarbage Collection for Higher Inductive Types
58mWhat is C++
22mLexical Effect Handler: Fast by Design, Correct by Proof
01h 11mProgramming language memory models: Problems, solutions, and directions