An Algebra of Sequential Decision Problems
summary
Formalises sequential decision processes in Agda and implements reusable composition primitives, claims small three combinators let one-dimensional step systems become product, coproduct and yielding hybrids that can switch state spaces at runtime, demonstrates composing 1D → 2D → 3D examples and a time-dependent variant, sketches a monadic probabilistic generalisation, publishes working code on GitHub, notes this is a short project-course prototype rather than a full optimisation library.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 0:40Model
- 3:48Compute trajectory
- 4:22Policy
- 4:40Initial State
- 5:01Vector State
- 5:46Policies
- 14:03Conclusion
related talks
22mAlgebraic Effects Meet Hoare Logic in Cubical Agda
01h 01mFunction Composition in Programming Languages
01h 07mAn introduction to synthetic guarded domain theory with applications to probabilistic(…)
27mBig Steps in Higher-Order Mathematical Operational Semantics
28mCombinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters
17mHefty Algebras: Modular Elaboration of Higher-Order Algebraic Effects
19mCombining Dependency, Grades, and Adjoint Logic
30mFormal Metatheory of Second-Order Abstract Syntax