Dijkstra's calculus of guarded commands incorporates nondeterminism into the branch and the loop statements. I argue in this paper that the course CS8, Organization of Programming Languages, is an appropriate place to introduce this semantics for a language control structure into the undergraduate curriculum. In section IV I present a short implementation for the Dijkstra do... od command as a function in Mathematica. The paper concludes with the application of this function to random walks.
/lp/association-for-computing-machinery/implementation-of-a-non-deterministic-loop-60o5duZTEY