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...
| Main Authors: | , |
|---|---|
| פורמט: | Conference item |
| שפה: | English |
| יצא לאור: |
Springer
2023
|