Probabilistic Strategies: Definability and the Tensor Completeness Problem

Nathan Bowler, Sergey Goncharov, Paul Blain Levy

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded…