Related papers: Distributive Laws for Monotone Specifications
One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition…
Category theory is famous for its innovative way of thinking of concepts by their descriptions, in particular by establishing universal properties. Concepts that can be characterized in a universal way receive a certain quality seal, which…
Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
Generalizing the algebraic formulation of the First Fundamental Theorem of Calculus (FFTC), a class of constraints involving a pair of operators was considered in \cite{ZGK2}. For a given constraint, the existences of extensions of…
In 2008, Loday shed light on the existence of Hopf-Boreltheorems for operads. Using the vocabulary of category theory, Livernet,Mesablishvili and Wisbauer extended such theorems to monads. In bothcases, the reasoning was to start from a…
We study here the well-known propagation rules for Boolean constraints. First we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between…
The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…
We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a…
By considering the situation in which the involved pseudomonads are presented in no-iteration form, we deduce a number of alternative presentations of pseudodistributive laws including a 'decagon' form, a pseudoalgebra form, a no-iteration…
The standard moment-sum-of-squares (SOS) hierarchy is a powerful method for solving global polynomial optimization problems. However, its convergence relies on Putinar's Positivstellensatz, which requires the feasible set to satisfy the…
The theorems of Kozlov and Sullivan characterize Gibbs measures as measures with positive continuous specifications. More precisely, Kozlov showed that every positive continuous specification on symbolic configurations of the lattice is…
Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to exist, and this has motivated investigations into weaker…
A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…
We present a corpus-based investigation of how the pitch contours of monosyllabic words are realized in spontaneous conversational Mandarin, focusing on the effects of words' meanings. We used the generalized additive model to decompose a…
Ordered random vectors are frequently encountered in many problems. The generalized order statistics (GOS) and sequential order statistics (SOS) are two general models for ordered random vectors. However, these two models do not capture the…
We study a categorical condition on relations, which is a categorical formulation of J\'onsson's characterisation of congruence distributive varieties. Categories satisfying these conditions need not be varieties; for instance, the dual of…
Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the…
In this chapter we propose Generic Ontology Design Patterns, GODPs, as a methodology for representing and instantiating ontology design patterns in a way that is adaptable, and allows domain experts (and other users) to safely use them…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…