Monads, partial evaluations, and rewriting

10/14/2018
by   Tobias Fritz, et al.
0

Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained as a partial evaluation of "2+2+1". This construction can be given for all monads on a concrete category, and it is linked to the famous bar construction, of which it gives an operational interpretation: the bar construction is a simplicial set, and its 1-cells are partial evaluations. We study the properties of partial evaluations for general monads. We prove that whenever the monad is weakly cartesian, partial evaluations can be composed via the usual Kan filler property of simplicial sets, of which we give an interpretation in terms of substitution of terms. In terms of rewritings, partial evaluations give an abstract reduction system which is reflexive, confluent, and transitive whenever the monad is weakly cartesian. For the case of probability monads, partial evaluations correspond to what probabilists call conditional expectation of random variables. This manuscript is part of a work in progress on a general rewriting interpretation of the bar construction.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/12/2021

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus...
09/14/2020

Bounds and Code Constructions for Partially Defect Memory Cells

This paper considers coding for so-called partially stuck memory cells. ...
06/18/2018

Lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...
06/18/2018

Linear lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...
10/04/2019

Construction of the Circle in UniMath

We show that the type TZ of Z-torsors has the dependent universal proper...
11/05/2020

The logic of contextuality

Contextuality is a key signature of quantum non-classicality, which has ...
09/24/2019

Data Interpretation Support in Rescue Operations: Application for French Firefighters

This work aims at developing a system that supports French firefighters ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.