On the correctness of monadic backward induction
From MaRDI portal
Recommendations
Cites work
- Algorithm design with Haskell
- Contributions to a computational theory of policy advice and avoidability
- Extensional equality preservation and verified generic programming
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 195199 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Idris, a general-purpose dependently typed programming language: Design and implementation
- On the correctness of monadic backward induction
- Probabilities, distribution monads, and convex categories
- Proofs of randomized algorithms in Coq
- Sequential decision problems, dependent types and generic solutions
- Stochastic optimal control. The discrete time case
Cited in
(3)
This page was built for publication: On the correctness of monadic backward induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019023)