Hybrid Automata and the Continuous Life
summary
Shows how hybrid automata combine differential flows and instantaneous jumps to model continuous-plus-discrete systems, and how SparkFund implements them as a Clojure library called hybrid-expression with three atomic constructors and four combinators for sequencing, repetition and parallel composition. Demonstrates waterfall financial contracts as stacked buckets, guarantees conservation of money by zero-sum flows, uses deterministic conflict resolution (deterministic left-most wins), and delivers a pure API with init/run/steady-state; watch if you need exact closed-form simulation of resource flows.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 5:13Hybrid Automata
- 9:00Growth Equation
- 15:09Algebraic Hybrid Automata
- 17:05Hybrid Process
- 19:24Flow Conditions
- 21:45Jump Conditions
- 22:46Combinators
- 23:56Repeating
- 25:33Semantics
- 29:05Hybrid State
- 30:09Hybrid Automata FRP
- 33:44Conclusion
related talks
35mAlways Be Composing
25mFunctional effect and streaming systems in Clojure
45mResidential Programming without Mutable State
30mRecognizing regular patterns in mixed type sequences using Symbolic Finite Automata
32mUI, Pure and Simple
40mFun with Functional Programming in Clojure
44mClojure core.async Evolution
01h 02mSolving Problems the Clojure Way