We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
We propose a system for the interpretation of anaphoric relationships between unbound pronouns and quantifiers. The main technical contribution of our proposal consists in combining generalized quantifiers with dependent types. Empirically, our syste
m allows a uniform treatment of all types of unbound anaphora, including the notoriously difficult cases such as quantificational subordination, cumulative and branching continuations, and donkey anaphora.
The main objective of the paper is to define the construction of the object of monoids, over a monoidal category object in any 2-category with finite products, as a weighted limit. To simplify the definition of the weight, we use matrices of symmetri
c (possibly colored) operads that define some auxiliary categories and 2-categories. Systematic use of these matrices of operads allows us to define several similar objects as weighted limits. We show, among others, that the constructions of the object of bi-monoids over a symmetric monoidal category object or the object of actions of monoids along an action of a monoidal category object can be also described as weighted limits.
We characterize the category of co-semi-analytic functors and describe an action of semi-analytic functors on co-semi-analytic functors.
We give an abstract categorical treatment of Plonka sums and products using lax and oplax morphisms of monads. Plonka sums were originally defined as operations on algebras of regular theories. Their arities are sup-semilattices. It turns out that ev
en more general operations are available on the categories of algebras of semi-analytic monads. Their arities are the categories of the regular polynomials over any sup-semilattice, i.e. any algebra for the terminal semi-analytic monad. We also show that similar operations can be defined on any category of algebras of any analytic monad. This time we can allow the arities to be the categories of linear polynomials over any commutative monoid, i.e. any algebra for the terminal analytic monad. There are also dual operations of Plonka products. They can be defined on Kleisli categories of commutative monads.
We characterize the category of monads on $Set$ and the category of Lawvere theories that are equivalent to the category of regular equational theories.
We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a subclass of the more familiar class of omega-categories, while multitopic
sets have been devised by Hermida, Makkai and Power as a vehicle for a definition of the concepts of weak omega-category. Our main result states that the category of multitopic sets is equivalent to that of many-to-one computads, a certain full subcategory of the category of all computads.
