As part of the author's studies on equational reasoning for monadic programs, this report focus on non-determinism monad. We discuss what properties this monad should satisfy, what additional operators and notations can be introduced to facilitate equational reasoning about non-determinism, and put them to the test by proving a number of properties in our example problem inspired by the author's previous work on proving properties of Spark aggregation.

翻译：作为提交人对蒙亚迪方案等式推理研究的一部分,本报告侧重于非决定性的寺院,我们讨论了这个寺院应满足哪些属性,可以采用哪些额外的操作员和标记来促进非决定性的等式推理,并通过在提交人以前关于证明斯帕克聚合特性的工作启发下,在我们的例子问题中证明一些属性,来检验这些属性。