Related papers: Monads for Measurable Queries in Probabilistic Dat…
The aim of this article is to establish basic results in a conditional measure theory. The results are applied to prove that arbitrary kernels and conditional distributions are represented by measures in a conditional set theory. In…
This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism…
Constrained quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with a finite number of supporting points lying on a specific set. The specific set is known as the…
We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concretely builds a distributive law between two monads, i.e.…
We study the problem of multiple hypothesis testing for multidimensional data when inter-correlations are present. The problem of multiple comparisons is common in many applications. When the data is multivariate and correlated, existing…
A new two-parameter discrete distribution, namely the PoiG distribution is derived by the convolution of a Poisson variate and an independently distributed geometric random variable. This distribution generalizes both the Poisson and…
In default of a fundamental MOND theory -- a FUNDAMOND -- I advocate that, alongside searching for one, we should try to identify predictions that follow from wide classes of MOND theories, if not necessarily from all. In particular,…
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. This paper shows that world-set algebra captures exactly…
Most research related to unithood were conducted as part of a larger effort for the determination of termhood. Consequently, novelties are rare in this small sub-field of term extraction. In addition, existing work were mostly empirically…
We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…
The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found on the linear-time/branching-time spectrum, over general system types. We describe a generic…
We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius…
We study the action of monads on categories equipped with several monoidal structures. We identify the structure and conditions that guarantee that the higher monoidal structure is inherited by the category of algebras over the monad.…
Pimentel et al. (2020) recently analysed probing from an information-theoretic perspective. They argue that probing should be seen as approximating a mutual information. This led to the rather unintuitive conclusion that representations…
Probabilistic programming languages, which exist in abundance, are languages that allow users to calculate probability distributions defined by probabilistic programs, by using inference algorithms. However, the underlying inference…
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
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…
The general notion of a stochastic ordering is that one probability distribution is smaller than a second one if the second attaches more probability to higher values than the first. Motivated by recent work on barycentric maps on spaces of…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
We establish a duality between monads and monadic morphisms in any $(\infty,2)$-category and characterize monadic morphisms in a wide class of examples. This duality unifies several dualities between algebraic structures and their…