Compile a tournament into a stream of operations that can have a straightforward interpreter implementation. Compilation relies on having an underlying monad that can manipulate a stream of code.

This may seem overkill but it greatly simplifies things in the implementation. The initial implementation generated a stream of rounds from a tournament directly, but the stream of rounds had to actually be a stream of stream of rounds, which had to be a stream of stream of streams of matches. This is ultimately because the Tournament language allows the ByStandings constructor anywhere, and because it can split or interleave tournaments at will. While I could just flatten all matches within a round, that feels antithetical to the goal of maximising how much of a tournament can be statically analysed.