English
Related papers

Related papers: Intersection Type Distributors

200 papers

We develop a 2-dimensional version of accessibility and presentability compatible with the formalism of flat pseudofunctors. First we give prerequisites on the different notions of 2-dimensional colimits, filteredness and cofinality; in…

Category Theory · Mathematics 2025-08-05 Ivan Di Liberti , Axel Osmond

We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…

Category Theory · Mathematics 2026-05-21 Yorgo Chamoun

First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching. Moreover, we study the weak variant…

Programming Languages · Computer Science 2015-07-01 Pietro Di Gianantonio , Furio Honsell , Marina Lenisa

We give an exposition of the semantics of the simply-typed lambda-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for…

Logic in Computer Science · Computer Science 2024-05-06 Philip Saville

We consider the linear lambda-calculus extended with the sup type constructor, which provides an additive conjunction along with a non-deterministic destructor. The sup type constructor has been introduced in the context of quantum…

Logic in Computer Science · Computer Science 2024-04-15 Alejandro Díaz-Caro , Octavio Malherbe

We assemble polynomials in a locally cartesian closed category into a tricategory, allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra. Working in the context of natural models of type theory, we prove…

Category Theory · Mathematics 2018-02-06 Steve Awodey , Clive Newstead

We develop the theory of tricategorical limits and colimits, and show that they can be modelled up to biequivalence via certain homotopically well-behaved limits and colimits enriched over the monoidal model category $\mathbf{Gray}$ of…

Category Theory · Mathematics 2024-09-04 Adrian Miranda

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Logic in Computer Science · Computer Science 2019-03-14 Pierre-Louis Curien , Samuel Mimram

Lax monoidal powerset-enriched monads yield a monoidal structure on the category of monoids in the Kleisli category of a monad. Exponentiable objects in this category are identified as those Kleisli monoids with algebraic structure. This…

Category Theory · Mathematics 2013-08-08 Dirk Hofmann , Frédéric Mynard , Gavin J. Seal

We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalizing the one introduced by…

Category Theory · Mathematics 2009-10-20 Yves Guiraud , Philippe Malbos

We give a double categorical version of the recently introduced notion of premonoidal bicategories. We introduce a funny product and a funny type of multicategory on double categories granting them a closed funny monoidal structure. We…

Category Theory · Mathematics 2026-04-29 Bojana Femić

We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…

Logic in Computer Science · Computer Science 2008-06-12 Fritz Müller

In-context learning (ICL) for text classification, which uses a few input-label demonstrations to describe a task, has demonstrated impressive performance on large language models (LLMs). However, the selection of in-context demonstrations…

Computation and Language · Computer Science 2025-11-17 Ye Jiang , Taihang Wang , Youzheng Liu , Yimin Wang , Yuhan Xia , Yunfei Long

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Logic in Computer Science · Computer Science 2024-02-26 Sara Ayhan

This paper presents equational-based logics for proving first order properties of programming languages involving effects. We propose two dual inference system patterns that can be instanciated with monads or comonads in order to be used…

Logic in Computer Science · Computer Science 2013-10-15 Jean-Guillaume Dumas , Dominique Duval , Jean-Claude Reynaud

Differential lambda-categories were introduced by Bucciarelli et al. as models for the simply typed version of the differential lambda-calculus of Ehrhard and Regnier. A differential lambda-category is a cartesian closed differential…

Category Theory · Mathematics 2012-02-28 Oleksandr Manzyuk

We investigate the properties of the Kleisli category KlT of a monad (T,{\lambda},{\mu}) on a category E and in particular the existence of (some kind of) pullbacks. This culminates when the monad is cartesian. In this case, we show that…

Category Theory · Mathematics 2024-01-23 Dominique Bourn

We characterize in terms of bicategories actions of monoidal categories to representation categories of algebras. For that purpose we introduce cocycles in any 2-category $\K$ and the category of Tambara modules over a monad $B$ in $\K$. We…

Quantum Algebra · Mathematics 2018-04-30 Bojana Femić

We study monoidal 2-categories and bicategories in terms of categorical extensions and the cohomological data they determine in appropriate cohomology theories with coefficients in Picard groupoids. In particular, we analyze the hierarchy…

Category Theory · Mathematics 2024-11-19 Ettore Aldrovandi , Milind Gunjal

Kleisli bicategories are a natural environment in which the combinatorics involved in various notions of algebraic theory can be handled in a uniform way. The setting allows a clear account of comparisons between such notions. Algebraic…

Category Theory · Mathematics 2013-12-02 Martin Hyland
‹ Prev 1 3 4 5 6 7 10 Next ›