Andrew Miloradovsky is a user on functional.cafe. You can follow them or interact with them if you have an account anywhere in the fediverse.
If you don't, you can sign up here.
Formal Verification of Probabilistic Algorithms
Joe Hurd. May 2003
"[…]
Probabilistic programs are modelled using the state-transformer #monad familiar from #functional #programming, where the random bit generator is passed around in the computation. Functions remove random bits from the generator to perform their calculation, and then pass back the changed random bit generator with the result.
[…]"
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-566.pdf
(CU) Computer Laboratory technical reports:
