Related papers: Modular specification of monads through higher-ord…
In this paper we study a 2-dimensional version of Quillen's homotopy category construction. Given a category $\mathscr{A}$ and a class of morphisms $\Sigma \subset \mathscr{A}$ containing the identities, we construct a 2-category…
The category ${\rm gp}(\Lambda)$ of Gorenstein-projective modules over tensor algebra $\Lambda = A\otimes_kB$ can be described as the monomorphism category ${\rm mon}(B, {\rm gp}(A))$ of $B$ over ${\rm gp}(A)$. In particular,…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
For a generalisation of the classical theory of Hopf algebra over fields, A. Brugui\`eres and A. Virelizier study opmonoidal monads on monoidal categories (which they called {\em bimonads}). In a recent joint paper with S. Lack the same…
Parameterization extends higher-order processes with the capability of abstraction and application (like those in lambda-calculus). This extension is strict, i.e., higher-order processes equipped with parameterization is computationally…
We define the dual F-signature of modules, which is equivalent to the F-signature if the module is the base ring. By using this invariant, We give characterizations of regular, F-regular, F-rational, and Gorenstein singularities.
Tangent category theory is a well-established categorical context for differential geometry. In a previous paper, a formal approach was adopted to provide a genuine Grothendieck construction in the context of tangent categories by…
The aim of this paper is to solve a problem proposed by Dominique Bourn: to provide a categorical-algebraic characterisation of groups amongst monoids and of rings amongst semirings. In the case of monoids, our solution is given by the…
Traditional approaches to modelling parallelism and algebraic structure in lambda calculi often rely on monads$\unicode{x2013}$as in Moggi's framework$\unicode{x2013}$or on rich categorical structures such as biproducts$\unicode{x2013}$as…
We introduce a notion of signature whose sorts form a direct category, and study computads for such signatures. Algebras for such a signature are presheaves with an interpretation of every function symbol of the signature, and we describe…
We develop a theory of adjunctions in semigroup categories, i.e. monoidal categories without a unit object. We show that a rigid semigroup category is promonoidal, and thus one can naturally adjoin a unit object to it. This extends the…
We prove that the free algebra functor associated to a symmetric, pseudo commutative 2-monad, from the underlying symmetric monoidal 2-category to the 2-category of algebras and pseudo maps over the 2-monad can be enhanced to a…
We observe that normalization by evaluation for simply-typed lambda-calculus with weak coproducts can be carried out in a weak bi-cartesian closed category of presheaves equipped with a monad that allows us to perform case distinction on…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
Higher-order unification (HOU) concerns unification of (extensions of) $\lambda$-calculus and can be seen as an instance of equational unification ($E$-unification) modulo $\beta\eta$-equivalence of $\lambda$-terms. We study equational…
We present a proof system for a multimodal logic, based on our previous work on a multimodal Martin-Loef type theory. The specification of modes, modalities, and implications between them is given as a mode theory, i.e. a small 2-category.…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
In this article, the author analyses distributive and mixed distributive laws and some of their equivalences through the use of 2-adjunctions of the type $\Adj$-$\Mnd$. As far as the distributive laws are concerned, the equivalence between…
Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…