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

01/23/2021
by   Shin-Cheng Mu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/16/2022

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

We establish a general framework for reasoning about the relationship be...
11/10/2017

Judgment aggregation in non-classical logics

This work contributes to the theory of judgment aggregation by discussin...
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...
02/20/2015

A partial taxonomy of judgment aggregation rules, and their properties

The literature on judgment aggregation is moving from studying impossibi...
03/05/2018

Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction

The aim of this paper is to introduce a new framework for defining abduc...
05/28/2014

On the cost-complexity of multi-context systems

Multi-context systems provide a powerful framework for modelling informa...
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...