Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorBotta, Nicola
dc.contributor.authorIonescu, Cezar
dc.contributor.authorBrady, Edwin Charles
dc.date.accessioned2013-08-05T17:01:01Z
dc.date.available2013-08-05T17:01:01Z
dc.date.issued2013
dc.identifier.citationBotta , 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 .en
dc.identifier.citationconferenceen
dc.identifier.otherPURE: 62964317
dc.identifier.otherPURE UUID: d15eaf67-5933-41d9-a0ec-6277b6e91d56
dc.identifier.otherScopus: 84924912357
dc.identifier.otherORCID: /0000-0002-9734-367X/work/58054928
dc.identifier.urihttps://hdl.handle.net/10023/3921
dc.description.abstractWe 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 [2] 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.
dc.language.isoeng
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleSequential decision problems, dependently typed solutionsen
dc.typeConference paperen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.description.statusNon peer revieweden
dc.identifier.urlhttp://www.cicm-conference.org/2013/cicm.php?event=&menu=talksen


This item appears in the following Collection(s)

Show simple item record