Related papers: Quotients in monadic programming: Projective algeb…

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

We say that a nonselfadjoint operator algebra is partly free if it contains a free semigroup algebra. Motivation for such algebras occurs in the setting of what we call free semigroupoid algebras. These are the weak operator topology closed…

In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspects of the lambda calculus: on the one hand, in the monadic…

We consider the structure of classes of curves on a projective simply connected surface for which fundamental groups of the complements admit free quotients having rank greater than one with irreducible components belonging to a selected…

Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous data types" such as the real line. So far however, they…

We construct monads for framed torsion-free sheaves on blow-ups of the complex projective plane at finitely many distinct points. Using these monads we prove that the moduli space of such sheaves is a smooth algebraic variety. Moreover we…

In my Montreal lecture notes of 1988, it was suggested that the theory of linear quantum groups can be presented in the framework of the category of {\it quadratic algebras} (imagined as algebras of functions on "quantum linear spaces"),…

In this paper we apply a recently proposed algebraic theory of integration to projective group algebras. These structures have received some attention in connection with the compactification of the $M$ theory on noncommutative tori. This…

Quantitative algebras are algebras enriched in the category $\mathsf{Met}$ of metric spaces so that all operations are nonexpanding. Mardare, Plotkin and Panangaden introduced varieties (aka $1$-basic varieties) as classes of quantitative…

Many combinatorial optimisation problems hide algebraic structures that, once exposed, shrink the search space and improve the chance of finding the global optimal solution. We present a general framework that (i) identifies algebraic…

The set of points of a one-dimensional cut-and-project quasicrystal or model set, while not additive, is shown to be multiplicative for appropriate choices of acceptance windows. This leads to the definition of an associative additive…

The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…

Algebras defined over fields of characteristic zero and positive characteristic usually do not behave the same way. However, for certain algebras, for example the group algebras, they behave the same way as the characteristic zero case at…

This note studies the quantized corner structure of four-dimensional $BF$ theory, classifies the associated free and physical corner algebras and constructs possible representations. In the abelian case, for arbitrary closed oriented…

Generalizing cones over projective toric varieties, we present arbitrary toric varieties as quotients of quasiaffine toric varieties. Such quotient presentations correspond to groups of Weil divisors generating the topology. Groups…

We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term…

Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…

Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the…

In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…

We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…