Algorithm design with the selection monad
The selection monad has proven useful for modelling exhaustive search algorithms. It is well studied in the area of game theory as an elegant way of expressing algorithms that calculate optimal plays for sequential games with perfect information; composition of moves is modeled as a ‘product’ of sel...
主要な著者: | Hartmann, J, Gibbons, J |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Springer
2023
|
類似資料
-
Monads for behaviour
著者:: Piróg, M, 等
出版事項: (2013) -
Monads for behaviour
著者:: Piróg, M, 等
出版事項: (2013) -
The coinductive resumption monad
著者:: Piróg, M, 等
出版事項: (2014) -
The coinductive resumption monad
著者:: Piróg, M, 等
出版事項: (2014) -
Unifying Theories of Programming with Monads
著者:: Gibbons, J
出版事項: (2012)