Related papers: Modular specification of monads through higher-ord…
In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on…
We show that every action operad gives rise to a notion of monoidal category via the categorical version of the Borel construction, embedding action operads into the category of 2-monads on $\mathbf{Cat}$. We characterize those 2-monads in…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
A framework for higher gauge theory based on a 2-group is presented, by constructing a groupoid of connections on a manifold acted on by a 2-group of gauge transformations, following previous work by the authors where the general notion of…
We construct a cycle in higher Hochschild homology associated to the 2-dimensional torus which represents 2-holonomy of a non-abelian gerbe in the same way the ordinary holonomy of a principal G-bundle gives rise to a cycle in ordinary…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a…
We consider the 3-category $2\mathfrak{C}at$ whose objects are 2-categories, 1-morphisms are lax functors, 2-morphisms are lax transformations and 3-morphisms are modifications. The aim is to show that it carries interesting…
We provide an explicit and elementary construction of the Morita $(\infty,2)$-category of a monoidal category which satisfies minimal conditions. We construct it as a $3$-coskeletal $2$-complicial set, in which the vertices encode the…
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Higher-order functions and imperative states are language features supported by many mainstream languages. Their combination is expressive and useful, but complicates specification and reasoning, due to the use of yet-to-be-instantiated…
Bilinear pseudodifferential operators with symbols in the bilinear analog of all the H\"ormander classes are considered and the possibility of a symbolic calculus for the transposes of the operators in such classes is investigated. Precise…
It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…
The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and…
In this paper, we study finitary 1-truncated higher inductive types (HITs) in homotopy type theory. We start by showing that all these types can be constructed from the groupoid quotient. We define an internal notion of signatures for HITs,…
Inspired by recent work of Batanin and Berger on the homotopy theory of operads, a general monad-theoretic context for speaking about structures within structures is presented, and the problem of constructing the universal ambient structure…
We study a family of distributors-induced bicategorical models of lambda-calculus, proving that they can be syntactically presented via intersection type systems. We first introduce a class of 2-monads whose algebras are monoidal categories…