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

page 1

page 2

page 3

page 4

research
12/12/2021

Interpreting Lambda Calculus in Domain-Valued Random Variables

We develop Boolean-valued domain theory and show how the lambda-calculus...
research
06/09/2022

Universal Properties of Partial Quantum Maps

We provide a universal construction of the category of finite-dimensiona...
research
09/14/2020

Bounds and Code Constructions for Partially Defect Memory Cells

This paper considers coding for so-called partially stuck memory cells. ...
research
07/06/2022

Partial Residuated Implications Derived from Partial Triangular Norms and Partial Residuated Lattices

In this paper, we reveal some relations between fuzzy logic and quantum ...
research
06/18/2018

Lambda-calculus and Reversible Automatic Combinators

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

Linear lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...
research
12/12/2022

On an Interpretation of ResNets via Solution Constructions

This paper first constructs a typical solution of ResNets for multi-cate...

Please sign up or login with your details

Forgot password? Click here to reset