Skip to content
Switch branches/tags
Go to file

Latest commit


Git stats


Failed to load latest commit information.
Latest commit message
Commit time

Sequential Decision Problems

This repository contains Idris code supporting the computation of Sequential Decision Problems (SDPs). The ongoing research is also documented in some research papers (see below).

2016-08-18: Note The development has moved to a new gitlab repo at PIK:

Some related Agda code is available in patrikja/SeqDecProb_Agda.

Idris source code

Research papers

2013: SDPs, dependently-typed solutions

Title: Sequential decision problems, dependently-typed solutions.

Authors: Nicola Botta, Cezar Ionescu, and Edwin Brady.


Published in Proceedings of the Conferences on Intelligent Computer Mathematics (CICM 2013), "Programming Languages for Mechanized Mathematics Systems Workshop (PLMMS)", volume 1010 of CEUR Workshop Proceedings, 2013.

2014-2016: SDPs, dependent types and generic solutions (Accepted for LMCS 2016-10)

Title: Sequential decision problems, dependent types and generic solutions

  • 2014-08: Submitted for publication
  • 2015-06: Received referee reports
  • 2015-07: Resubmitted.
  • 2015-12: Received 2nd round of referee reports
  • 2016-02: Resubmitted.
  • 2016-07: Received 3rd round of referee reports ("Accept with minor revision")
  • 2016-08: Resubmitted.
  • 2016-10: Accepted for publication in LICS (as is). Available at arXiv.
  • 2017-03: Finally appeared in LMCS proper under DOI = 10.23638/LMCS-13(1:7)2017,

Authors: Nicola Botta, Patrik Jansson, Cezar Ionescu, David R. Christiansen, Edwin Brady

2015-2016: Contributions to a computational theory of policy advice and avoidability

Authors: Nicola Botta, Patrik Jansson, Cezar Ionescu

The work was partially supported by the GRACeFUL project (640954, from the call H2020-FETPROACT-2014) and by the CoeGSS project (676547, H2020-EINFRA-2015-1) in the context of Global Systems Science (GSS).


No description, website, or topics provided.



No packages published