Last week Dan Peebles asked me on Twitter if I knew of any writing on the use
of recursion schemes for expressing stochastic processes or other probability
distributions. And I don’t! So I’ll write some of what I do know myself.

The Giry monad is the canonical probability monad that operates on the level of
measures, which are the abstract constructs that canonically represent
probability distributions. It’s sort of the baseline by which all other
probability monads can be...

To the.. uh, ‘layperson’, pre- and postpromorphisms are probably well into the
WTF category of recursion schemes. This is a mistake - they’re simple and
useful, and I’m going to try and convince you of this in short order.

Lately I’ve been trying to do some magic by way of nonstandard interpretations
of abstract syntax. One of the things that I’ve managed to grok along the way
has been the problem of sharing in deeply-embedded languages.