AI Chat AI Image Generator AI Video Text to Speech

Equational reasoning for non-determinism monad: the case of Spark aggregation

01/23/2021

∙

by Shin-Cheng Mu, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 04/03/2023

Every Author as First Author

We propose a new standard for writing author names on papers and in bibl...

0 Erik D. Demaine, et al. ∙

research

∙ 02/16/2022

Galois connecting call-by-value and call-by-name

We establish a general framework for reasoning about the relationship be...

0 Dylan McDermott, et al. ∙

research

∙ 04/14/2018

Reasoning About TSO Programs Using Reduction and Abstraction

We present a method for proving that a program running under the Total S...

0 Ahmed Bouajjani, et al. ∙

research

∙ 02/20/2015

A partial taxonomy of judgment aggregation rules, and their properties

The literature on judgment aggregation is moving from studying impossibi...

0 Jerome Lang, et al. ∙

research

∙ 02/15/2022

A General Framework for Modelling Conditional Reasoning – Preliminary Report

We introduce and investigate here a formalisation for conditionals that ...

0 Giovanni Casini, et al. ∙

research

∙ 03/27/2013

Problem Structure and Evidential Reasoning

In our previous series of studies to investigate the role of evidential ...

0 Richard M. Tong, et al. ∙

research

∙ 03/28/2019

Analysis and Extension of the Evidential Reasoning Algorithm for Multiple Attribute Decision Analysis with Uncertainty

In multiple attribute decision analysis (MADA) problems, one often needs...

0 Lianmeng Jiao, et al. ∙