DeepAI AI Chat
Log In Sign Up

A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism

by   Reynald Affeldt, et al.

The algebraic properties of the combination of probabilistic choice and nondeterministic choice have long been a research topic in program semantics. This paper explains a formalization (the first one to the best of our knowledge) in the Coq proof assistant of a monad equipped with both choices: the geometrically convex monad. This formalization has an immediate application: it provides a model for a monad that implements a non-trivial interface which allows for proofs by equational reasoning using probabilistic and nondeterministic effects. We explain the technical choices we made to go from the literature to a complete Coq formalization, from which we identify reusable theories about mathematical structures such as convex spaces and concrete categories.


page 1

page 2

page 3

page 4


Free complete Wasserstein algebras

We present an algebraic account of the Wasserstein distances W_p on comp...

Proof Theory of Riesz Spaces and Modal Riesz Spaces

We design hypersequent calculus proof systems for the theories of Riesz ...

Representing and Reasoning With Probabilistic Knowledge: A Bayesian Approach

PAGODA (Probabilistic Autonomous Goal-Directed Agent) is a model for aut...

Modelling High-Level Mathematical Reasoning in Mechanised Declarative Proofs

Mathematical proofs can be mechanised using proof assistants to eliminat...

Constraint-Based Synthesis of Coupling Proofs

Proof by coupling is a classical technique for proving properties about ...

Smart Choices and the Selection Monad

Describing systems in terms of choices and their resulting costs and rew...

A New Proof Rule for Almost-Sure Termination

An important question for a probabilistic program is whether the probabi...