Tim Stokes
A DR-semigroup $S$ (also known as a reduced E-semiabundant or reduced E-Fountain semigroup) is here viewed as a semigroup equipped with two unary operations $D,R$ satisfying finitely many equational laws. Examples include DRC-semigroups…
We give an algebraic characterisation of ordered groupoids, namely, we show that there is a categorical isomophism between the category of ordered groupoids and the category of $D$-inverse constellations. Here constellations are partial…
We obtain an ESN theorem for a very general class of biunary semigroups with idempotent-valued domain and range operations, representing them in terms of small categories equipped with a suitable biaction of the identities on the category.…
Given a monoid $S$ with $E$ any non-empty subset of its idempotents, we present a novel one-sided version of idempotent completion we call left $E$-completion. In general, the construction yields a one-sided variant of a small category…
We present axiomatisations for a number of partial function signatures that include domain restriction, modelled as a right normal band operation. Other operations considered are override and update, difference, minus, intersection,…
Ehresmann semigroups may be viewed as biunary semigroups equipped with domain and range operations satisfying some equational laws. Motivated by some of the main examples, we here define ordered Ehresmann semigroups, and consider their…
Constellations are asymmetric generalisations of categories. Although they are not required to possess a notion of range, many natural examples do. These include commonly occurring constellations related to concrete categories (since they…
The {\em override} operation $\sqcup$ is a natural one in computer science, and has connections with other areas of mathematics such as hyperplane arrangements. For arbitrary functions $f$ and $g$, $f\sqcup g$ is the function with domain…
Demonic composition, demonic refinement and demonic union are alternatives to the usual "angelic" composition, angelic refinement (inclusion) and angelic (usual) union defined on binary relations. We first motivate both the angelic and…
Override and update are natural constructions for combining partial functions, which arise in various program specification contexts. We use an unexpected connection with combinatorial geometry to provide a complete finite system of…
Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…