Algorithm Design with the Selection Monad

1. Bolt, J., Hedges, J., Zahn, P.: Sequential games and nondeterministic selection functions. arXiv preprint arXiv:1811.06810 (2018)

2. Escardó, M., Oliva, P.: Selection functions, bar recursion and backward induction. Math. Struct. Comput. Sci. 20(2), 127–168 (2010)

   Article  MathSciNet  MATH  Google Scholar 

3. Escardó, M., Oliva, P.: What sequential games, the Tychonoff theorem and the double-negation shift have in common. In: Proceedings of the Third ACM SIGPLAN Workshop on Mathematically Structured Functional Programming, pp. 21–32 (2010)

   Google Scholar 

4. Escardó, M., Oliva, P.: Sequential games and optimal strategies. Proc. R. Soc. A: Math. Phys. Eng. Sci. 467(2130), 1519–1545 (2011)

   Article  MathSciNet  MATH  Google Scholar 

5. Hartmann, J.: Finding optimal strategies in sequential games with the novel selection monad. arXiv preprint arXiv:2105.12514 (2018)

6. Hartmann, J.: Dependently typed selection monad (2022). https://github.com/IncredibleHannes/DependentlyTypedSelectionMonad

7. Hedges, J.: The selection monad as a CPS transformation. arXiv preprint arXiv:1503.06061 (2015)

8. Hedges, J.M.: Towards compositional game theory. Ph.D. thesis, Queen Mary University of London (2016)

   Google Scholar 

9. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)

   Article  Google Scholar 

Download references