Related papers: Strictification of weakly stable type-theoretic st…
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable stratification of the type and effect system entails the…
We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
We present a family of model structures on the category of multicomplexes. There is a cofibrantly generated model structure in which the weak equivalences are the morphisms inducing an isomorphism at a fixed stage of an associated spectral…
Weakly approximable triangulated categories, introduced by Neeman, provide a powerful framework for studying localization phenomena in triangulated categories. In this paper, we establish new localization theorems showing that, under mild…
Given a programming language, can we give a monadic denotational semantics that is stable under language extension? Models containing only a single monad are not stable. Models based on type-and-effect systems, in which there is a monad for…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators $S$ and relations $R$ is \emph{stable} if any map from $S$ to unitaries that approximately satisfies…
In this paper we introduce a notion of tightness for a family of nonlinear expectations and show that the tightness can be applied to obtain weak compactness in a framework of nonlinear expectation space. This criterion is very useful for…
An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…
We investigate the universal strictification adjunction from weak $\infty$-groupoids (modeled as simplicial sets) to strict $\infty$-groupoids (modeled as simplicial T-complexes). We prove that any simplicial set can be recovered up to weak…
The natural occurrence of singular spaces in applications has led to recent investigations on performing topological data analysis (TDA) in a stratified framework. In many applications, there is no a priori information on what points should…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
This article presents three characterizations of the weak factorization systems on finitely complete categories that interpret intensional dependent type theory with Sigma-, Pi-, and Id-types. The first characterization is that the weak…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
Given a limit sketch in which the cones have a finite connected base, we show that a model structure of "up to homotopy" models for this limit sketch in a suitable model category can be transferred to a Quillen equivalent model structure on…
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular weak $\omega$-categories, and we formalise this theory in the language of homotopy type theory. Most of the studies about this type theory…
We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…
We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…