Related papers: Natural Transformations as Rewrite Rules and Monad…
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…
Many structured categories of interest are most naturally described as algebras for a relative monad, but turn out nonetheless to be algebras for an ordinary monad. We show that, under suitable hypotheses, the left oplax Kan extension of a…
All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
We present an alternate proof of Giraud's Theorem based on the fact that given the conditions on a category E for being a topos, its objects are sheaves by construction. Generalizing sets to R-modules for R a commutative ring, we prove that…
We construct a Continuous Wavelet Transform (CWT) on the torus $\mathbb T^2$ following a group-theoretical approach based on the conformal group $SO(2,2)$. The Euclidean limit reproduces wavelets on the plane $\mathbb R^2$ with two…
In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
This is the fourth in a series of papers math.AG/0312190, math.AG/0503029, math.AG/0410267 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration is a finite collection of objects and…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
We explain two related constructions on the data of two monoidal symmetric closed categories $\mathscr{A}$ and $\mathscr{E}$ and monoidal functors $F: \mathscr{E}\to \mathscr{A}$ and $G: \mathscr{A}\to \mathscr{E}$. In a first part, we…
Natural language is compositional; the meaning of a sentence is a function of the meaning of its parts. This property allows humans to create and interpret novel sentences, generalizing robustly outside their prior experience. Neural…
Various spaces of symmetries of a structure are naturally endowed with both an algebraic and a topological structure. For example, the automorphism group of a structure is, on top of being a group, a topological group when equipped with the…
Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…