English
Related papers

Related papers: Monads and Quantitative Equational Theories for No…

200 papers

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 in the Coq proof assistant of a monad equipped with…

Logic in Computer Science · Computer Science 2023-12-12 Reynald Affeldt , Jacques Garrigue , David Nowak , Takafumi Saikawa

It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…

Logic · Mathematics 2022-10-25 Todd Schmid

We define and study a probability monad on the category of complete metric spaces and short maps. It assigns to each space the space of Radon probability measures on it with finite first moment, equipped with the Kantorovich-Wasserstein…

Probability · Mathematics 2019-03-13 Tobias Fritz , Paolo Perrone

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…

Logic in Computer Science · Computer Science 2021-04-22 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

We prove that every finitely generated convex set of finitely supported probability distributions has a unique base, and use this result to show that the monad of convex sets of probability distributions is presented by the algebraic theory…

Logic in Computer Science · Computer Science 2020-05-05 Filippo Bonchi , Ana Sokolova , Valeria Vignudelli

We show from a categorical point of view that probability measures on certain measurable or topological spaces arise canonically as the extension of probability distributions on countable sets. We do this by constructing probability monads…

Category Theory · Mathematics 2022-06-23 Ruben Van Belle

The theory of commutative monads on cartesian closed categories provides a framework where aspects of the theory of distributions and other extensive quantities can be formulated and some results proved. We make explicit a link between our…

Category Theory · Mathematics 2011-08-31 Anders Kock

We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…

Logic in Computer Science · Computer Science 2026-03-03 Matteo Mio

Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the…

Logic in Computer Science · Computer Science 2025-07-18 Quentin Aristote

In earlier work, we had introduced the Kantorovich probability monad on complete metric spaces, extending a construction due to van Breugel. Here we extend the Kantorovich monad further to a certain class of ordered metric spaces, by…

Probability · Mathematics 2020-02-27 Tobias Fritz , Paolo Perrone

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

Probability theory can be studied synthetically as the computational effect embodied by a commutative monad. In the recently proposed Markov categories, one works with an abstraction of the Kleisli category and then defines deterministic…

Logic in Computer Science · Computer Science 2022-12-06 Sean Moss , Paolo Perrone

Inspired by the seminal work of Hyland, Plotkin, and Power on the combination of algebraic computational effects via sum and tensor, we develop an analogous theory for the combination of quantitative algebraic effects. Quantitative…

Logic in Computer Science · Computer Science 2024-10-30 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…

Programming Languages · Computer Science 2024-10-31 Jack Liell-Cock , Sam Staton

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Category Theory · Mathematics 2012-01-18 Charles Grellois

Probability monads on categories of topological spaces are classical objects of study in the categorical approach to probability theory, with important applications in the semantics of probabilistic programming languages. We construct a…

Category Theory · Mathematics 2024-12-02 Peter Kristel , Benedikt Peterseim

We present a categorical viewpoint of probability measures by showing that a probability measure can be viewed as a weakly averaging affine measurable functional taking values in the unit interval which preserves limits. The probability…

Category Theory · Mathematics 2015-03-18 Kirk Sturtz

We give a conceptual treatment of the notion of joints, marginals, and independence in the setting of categorical probability. This is achieved by endowing the usual probability monads (like the Giry monad) with a monoidal and an opmonoidal…

Probability · Mathematics 2020-02-03 Tobias Fritz , Paolo Perrone

In recent times, there has been a growing interest in a structuralist understanding of probability, measure and integration theory. The present thesis contributes to this programme in three ways. First, we construct a commutative…

Category Theory · Mathematics 2024-04-01 Benedikt Peterseim

Convex algebras, also called (semi)convex sets, are at the heart of modelling probabilistic systems including probabilistic automata. Abstractly, they are the Eilenberg-Moore algebras of the finitely supported distribution monad.…

Logic in Computer Science · Computer Science 2023-06-22 Ana Sokolova , Harald Woracek
‹ Prev 1 2 3 10 Next ›