Related papers: Graded String Diagrams for Imprecise Probability a…
We spell out the paradigm of exact conditioning as an intuitive and powerful way of conditioning on observations in probabilistic programs. This is contrasted with likelihood-based scoring known from languages such as Stan. We study exact…
Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…
We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…
We introduce a new type of diagrams and prove the existence of a particular one, the "central tuned diagram", with some optimal features, for finitely generated modules of certain categories. This is achieved by getting to the idea of "the…
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with…
Given a presentably symmetric monoidal $\infty$-category $\mathcal{C}$ and an $\mathbb{E}_{\infty}$-monoid $M$, we introduce and classify twisted graded categories, which generalize the Day convolution structure on $\mathrm{Fun}(M,…
Many algorithms are specified with respect to a fixed but unspecified parameter. Examples of this are especially common in cryptography, where protocols often feature a security parameter such as the bit length of a secret key. Our aim is…
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…
In this paper, we state and prove precise theorems on the classification of the category of (braided) categorical groups and their (braided) monoidal functors, and some applications obtained from the basic studies on monoidal functors…
We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality !L*, which has a limited edition of the contraction and permutation rules. The categorical part of the semantics is a monoidal…
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
In this paper we investigate the use of staged tree models for discrete longitudinal data. Staged trees are a type of probabilistic graphical model for finite sample space processes. They are a natural fit for longitudinal data because a…
We give a generalization of the theory of $\mathbb{Z}_2$-graded manifolds to a theory of $\mathcal{I}$-graded manifolds, where $\mathcal{I}$ is a commutative semi-ring with some additional properties. We prove Batchelor's theorem in this…
The aim of this paper is to propose a many-valued modal framework to formalize reasoning with both graded preferences and propositions, in the style of van Benthem et al.'s classical modal logics for preferences. To do so, we start from Bou…
The article proposes a method for constructing non-standard theories based on terms from partially existing sequences of elements. The method is illustrated by the example of the theory of monoids. Predicates and terms from non-standard…
The exactly integrable systems connected with semisimple series $A$ for arbitrary grading are presented in explicit form. Their general solutions are expressed in terms of the matrix elements of various fundamental representations of $A_n$…
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree.…
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are…
The field of directed type theory seeks to design type theories capable of reasoning synthetically about (higher) categories, by generalizing the symmetric identity types of Martin-L\"of Type Theory to asymmetric hom-types. We articulate…