Related papers: Complete Elgot Monads and Coalgebraic Resumptions

Inference algorithms for probabilistic programming are complex imperative programs with many moving parts. Efficient inference often requires customising an algorithm to a particular probabilistic model or problem, sometimes called…

Contextual embeddings, such as ELMo and BERT, move beyond global word representations like Word2Vec and achieve ground-breaking performance on a wide range of natural language processing tasks. Contextual embeddings assign each word a…

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…

With the rapid development of deep learning, most of current state-of-the-art techniques in natural langauge processing are based on deep learning models trained with argescaled static textual corpora. However, we human beings learn and…

Starting with conformally covariant correlation functions, a sequence of functional representations of the conformal algebra is constructed. A key step is the introduction of representations which involve an auxiliary functional. It is…

Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…

Hopf monads generalise Hopf algebras. They clarify several aspects of the theory of Hopf algebras and capture several related structures such as weak Hopf algebras and Hopf algebroids. However, important parts of Hopf algebra theory are not…

We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…

We introduce and study Hopf monads on autonomous categories (i.e., monoidal categories with duals). Hopf monads generalize Hopf algebras to a non-braided (and non-linear) setting. Indeed, any monoidal adjunction between autonomous…

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

We describe a simplified categorical approach to Galois descent theory. It is well known that Galois descent is a special case of Grothendieck descent, and that under mild additional conditions the category of Grothendieck descent data…

We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.

This note recapitulates and expands the contents of a tutorial on the mathematical theory of algebraic effects and handlers which I gave at the Dagstuhl seminar 18172 "Algebraic effect handlers go mainstream". It is targeted roughly at the…

We introduce an algebraic analogue of dynamical systems, based on term rewriting. We show that a recursive function applied to the output of an iterated rewriting system defines a formal class of models into which all the main architectures…

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to…

Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…

Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…

The Colombeau algebra of generalized functions allows to unrestrictedly carry out products of distributions. We analyze this operation from a microlocal point of view, deriving a general inclusion relation for wave front sets of products in…

We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…