Related papers: A General Probabilistic Framework in IMALL: A Conc…
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…
We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…
Starting from a (small) rigid C$^*$-tensor category $\mathscr{C}$ with simple unit, we construct von Neumann algebras associated to each of its objects. These algebras are factors and can be either semifinite (of type II$_1$ or II$_\infty$,…
We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
Linear and substructural types are powerful tools, but adding them to standard functional programming languages often means introducing extra annotations and typing machinery. We propose a lightweight substructural type system design that…
Semi-functional linear regression models postulate a linear relationship between a scalar response and a functional covariate, and also include a non-parametric component involving a univariate explanatory variable. It is of practical…
We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…
In this article, we address the classification of smooth projective algebraic surfaces over complex numbers admitting algebraic semigroup structures. We give a full description of those surfaces $S$, which has at least one non-trivial…
Furber and Jacobs have shown in their study of quantum computation that the category of commutative C*-algebras and PU-maps (positive linear maps which preserve the unit) is isomorphic to the Kleisli category of a comonad on the category of…
Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…
In this paper we follow the constructions of Turaev's book [Tu] closely, but with small modifications, to construct of a modular functor, in the sense of Kevin Walker, from any modular tensor category. We further show that this modular…
This is the second paper in a series on enumerative invariants counting self-dual objects in self-dual categories, and is a sequal to (arXiv:2302.00038). Ordinary enumerative invariants in abelian categories can be seen as invariants for…
For general finite-dimensional self-injective algebra $A$ we construct a family of injective coassociative coproducts $A\to A\otimes A$, all $A$-bimodule morphisms. In particular such structures always exist, confirming a conjecture of…
We classify the finite dimensional indecomposable sl(m/n)-modules with at least a typical or singly atypical primitive weight. We do this classification not only for weight modules, but also for generalized weight modules. We obtain that…
We develop the theory of strong and commutative monads in the 2-dimensional setting of bicategories. This provides a framework for the analysis of effects in many recent models which form bicategories and not categories, such as those based…
In this paper we study conjugacy classes for pivotal fusion categories. In particular we prove a Burnside type formula for the structure constants concerning the product of two conjugacy class sums of a such fusion category. For a braided…
Understanding the predictions made by deep learning models remains a central challenge, especially in high-stakes applications. A promising approach is to equip models with the ability to answer counterfactual questions -- hypothetical…
Over a commutative noetherian ring $R$ of finite Krull dimension, we show that every complex of flat cotorsion $R$-modules decomposes as a direct sum of a minimal complex and a contractible complex. Moreover, we define the notion of a…
In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…