Sequential decision problems, dependently typed solutions
MetadataShow full item record
We propose a dependently typed formalization for a simple class of sequential decision problems. For this class of problems, we im- plement a generic version of Bellman's backwards induction algorithm  and a machine checkable proof that the proposed implementation is correct. The formalization is generic. It is presented in Idris, but it can be easily translated to other dependently-typed programming languages. We conclude with an informal discussion of the problems we have faced in extending the formalization to generic monadic sequential decision problems.
Botta , N , Ionescu , C & Brady , E C 2013 , ' Sequential decision problems, dependently typed solutions ' , Paper presented at CICM 2013: Conference on Intelligent Computer Mathematics , Bath , United Kingdom , 8/07/13 - 12/07/13 .conference
Non peer reviewed
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.