相关论文: Intersection Type Distributors

We give an algebraic characterization of the syntax and semantics of a class of languages with variable binding. We introduce a notion of 2-signature: such a signature specifies not only the terms of a language, but also reduction rules on…

We construct explicitly the weights on the simplicial category so that the colimits and limits of 2-functors with those weights provide the Kleisli objects and the Eilenberg-Moore objects, respectively, in any 2-category.

We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…

We introduce a general construction on 2-monads. We develop background on maps of 2-monads, their left semi-algebras, and colimits in 2-category. Then, we introduce the construction of a colimit induced by a map of 2-monads, show that we…

Linearly distributive categories were introduced to model the tensor/par fragment of linear logic, without resorting to the use of negation. Linear bicategories are the bicategorical version of linearly distributive categories. Essentially,…

A weak mixed distributive law (also called weak entwining structure) in a 2-category consists of a monad and a comonad, together with a 2-cell relating them in a way which generalizes a mixed distributive law due to Beck. We show that a…

We study collections of additive categories $\mathcal{M}(G)$, indexed by finite groups $G$ and related by induction and restriction in a way that categorifies usual Mackey functors. We call them `Mackey 2-functors'. We provide a large…

In this paper we consider the conditions that need to be satisfied by two families of pseudofunctors with a common codomain for them to be collated into a bifunctor. We observe similarities between these conditions and distributive laws of…

Intersection types are an essential tool in the analysis of operational and denotational properties of lambda-terms and functional programs. Among them, non-idempotent intersection types provide precise quantitative information about the…

Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…

We put a model structure on a full subcategory of based multicategories in which the weak equivalences are created by the K-theory functor of Elmendorf-Mandell, providing a model categorical lift of Thomason's theorem on the modeling of…

We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal 3-category. This framework is well…

We prove a generalization of a theorem of Bunge and Gray about forming colax adjunctions out of relative Kan extensions and apply it to the study of the Kleisli 2-category for a lax-idempotent pseudomonad. For instance, we establish the…

The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the…

We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…

This is a short introduction to categories with some emphasis on coalgebras. We start from introducing basic notions (categories, functors, natural transformations), move to Kleisli tripels and monads, with a short discussion of monads in…

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…

We show how to construct a Gamma-bicategory from a symmetric monoidal bicategory, and use that to show that the classifying space is an infinite loop space upon group completion. We also show a way to relate this construction to the classic…

It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…