Related papers: Presenting Distributive Laws
Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads, they provide the basis on…
Communicating transactions is a form of distributed, non-isolated transactions which provides a simple construct for building concurrent systems. In this paper we develop a logical framework to express properties of the observable behaviour…
If $F$ is a (not necessarily associative) monad on $Set$, then the natural transformation $F(A\times B)\to F(A)\times F(B)$ is surjective if and only if $F(\boldsymbol{1})=\boldsymbol{1}$. Specializing $F$ to $F_{\mathcal{V}}$, the free…
This work proposes a novel methodology for measuring compositional behavior in contemporary language embedding models. Specifically, we focus on adjectival modifier phenomena in adjective-noun phrases. In recent years, distributional…
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…
Distributed representation plays an important role in deep learning based natural language processing. However, the representation of a sentence often varies in different tasks, which is usually learned from scratch and suffers from the…
In this paper, on the sublinear expectation space, we establish a comparison theorem between independent and convolutionary random vectors, which states that the partial sums of those two sequences of random vectors are identically…
A simple fragmentation model is introduced and analysed. We show that, under very general conditions, an effective power law for the mass distribution arises with realistic exponent. This exponent has a universal limit, but in practice the…
We study local conservation laws of variable coefficient diffusion-convection equations of the form $f(x)u_t=(g(x)A(u)u_x)_x+h(x)B(u)u_x$. The main tool of our investigation is the notion of equivalence of conservation laws with respect to…
The topic of this thesis is the application of distributive laws between comonads to the theory of cyclic homology. Explicitly, our main aims are: 1) To study how the cyclic homology of associative algebras and of Hopf algebras in the…
We establish a relative monadicity theorem for relative monads with dense roots in a virtual equipment, specialising to a relative monadicity theorem for enriched relative monads. In particular, for a dense $\mathbb V$-functor $j \colon A…
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…
Distributed order fractional Langevin-like equations are introduced and applied to describe anomalous diffusion without unique diffusion or scaling exponent. It is shown that these fractional Langevin equations of distributed order can be…
Ability to use definitions occurring in the code directly in equational reasoning is one of the key strengths of functional programming. This is impossible in the case of Haskell type class methods unless a particular instance type is…
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…
Current approaches to learning vector representations of text that are compatible between different languages usually require some amount of parallel text, aligned at word, sentence or at least document level. We hypothesize however, that…
A weak mixed distributive law (also called weak entwining structure) in a 2-category consists of a monad and a comonad, together with a 2-cell relating them in a way which generalizes a mixed distributive law due to Beck. We show that a…
We outline the theory of reflections for prederivators, derivators and stable derivators. In order to parallel the classical theory valid for categories, we outline how reflections can be equivalently described as categories of fractions,…
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…
Motivated by sensor networks and other distributed settings, several models for distributed learning are presented. The models differ from classical works in statistical pattern recognition by allocating observations of an independent and…