Reactive Programming on the Bare Metal:A Formal Model for a Low-Level Reactive Virtual Machin
summary
Claims a small-step operational semantics and a virtual machine called Remus VM that compiles each reactor to an instruction sequence so dependency order is fixed with compile-time topological sorts. The VM uses preallocated deployment regions and a toggle environment of branching points to deploy or reuse reactor instances, avoiding a runtime priority queue and continuous allocation. Implementation exists in PLT Redex (GitLab link in paper), single-threaded, no benchmark yet and no completed mechanized proof.
AI-written summary · about
chapters (11)
- 0:00Bare-metal reactive motivation
- 1:31Existing reactive languages compared
- 4:49Graph-based reactive challenges
- 7:35High reactive language intro
- 9:42Remus VM formal model
- 11:07Remus formalization insights
- 13:57Remus memory management
- 16:27Remus conditional deployments
- 18:55Remus performance benefits
- 21:47High vs Remus formalisms
- 22:54Q&A
related talks
39mThorium: Verifiable, Dynamic, Reactive Software
47mReactive Programming - Royal Road or Wrong Turn?
27mReactive: Understand and Embrace
24mThread-Safe Reactive Programming
31mTowards Higher-level Abstractions for Molecular Programming
01h 28mIntroduction to Reactive Programming
29mMultiparty Reactive Sessions
50mThe reactive landscape