Related papers: Propification and the Scalable Comonad
We define a broad class of deterministic stream functions and show they can be implemented as homomorphisms into a "state" monoid. The homomorphism laws are simpler than the conditions of previous semantic frameworks for stream program…
A PROP is a symmetric monoidal category, whose set of objects is the set of natural numbers and on objects the monoidal structure is given by the addition. An algebra over a PROP is a symmetric strict monoidal functor to the tensor category…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this paper is a contribution to building a general purpose DR…
A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…
We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, effectively showing how every hyperlinear approximation to such a group is simulated by a suitable sofic approximation. The…
Starting from any unital colored PROP $P$, we define a category $P(P)$ of shapes called $P$-propertopes. Presheaves on $P(P)$ are called $P$-propertopic sets. For $0 \leq n \leq \infty$ we define and study $n$-time categorified $P$-algebras…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories. Theories that factor as tensor products include the theory of commutative monoids…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
Our starting point is a particular `canvas' aimed to `draw' theories of physics, which has symmetric monoidal categories as its mathematical backbone. In this paper we consider the conceptual foundations for this canvas, and how these can…
Given a symmetric operad $P$, and a signature (or generating sequence) $\Phi$ for $P$, we define a notion of the "categorification" (or "weakening") of $P$ with respect to $\Phi$. When $P$ is the symmetric operad whose algebras are…
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams…
The use of aggregates in recursion enables efficient and scalable support for a wide range of BigData algorithms, including those used in graph applications, KDD applications, and ML applications, which have proven difficult to be expressed…
In this paper we propose, firstly, a categorification of virtual braid groups and groupoids in terms of "locally" braided objects in a symmetric category (SC), and, secondly, a definition of self-distributive structures (SDS) in an…
The Stratified Foundations are a restriction of naive set theory where the comprehension scheme is restricted to stratifiable propositions. It is known that this theory is consistent and that proofs strongly normalize in this theory.…
A monoidal category has a natural isomorphism $\alpha_{A,B,C}\colon(A\otimes B)\otimes C\to A\times (B\otimes C)$ called the associator. In the case where the objects $(A\otimes B)\otimes C$ and $A\otimes(B\otimes C)$ are equal, it is…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…