Related papers: Categorical models of subtyping
Grothendieck fibrations are fundamental in capturing the concept of dependency, notably in categorical semantics of type theory and programming languages. A relevant instance are Dialectica fibrations which generalise G\"odel's Dialectica…
In this paper, we study properties of maps between fibrant objects in model categories. We give a characterization of weak equivalences between fibrant object. If every object of a model category is fibrant, then we give a simple…
Locally cartesian closed (lcc) categories are natural categorical models of extensional dependent type theory. This paper introduces the "gros" semantics in the category of lcc categories: Instead of constructing an interpretation in a…
We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…
We define a simple kind of higher inductive type generalising dependent $W$-types, which we refer to as $W$-types with reductions. Just as dependent $W$-types can be characterised as initial algebras of certain endofunctors (referred to as…
We study locally presentable categories equipped with a cofibrantly generated weak factorization system. Our main result is that these categories are closed under 2-limits, in particular under pseudopullbacks. We give applications to…
We construct two model structures, whose fibrant objects capture the notions of discrete fibrations and of Grothendieck fibrations over a category $\mathcal{C}$. For the discrete case, we build a model structure on the slice…
Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…
In a recent paper we introduced a much weaker and easy to verify structure than a model category, which we called a "weak fibration category". We further showed that a small weak fibration category can be "completed" into a full model…
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…
We extend the framework of combinatorial model categories, so that the category of small presheaves over large indexing categories and ind-categories would be embraced by the new machinery called class-combinatorial model categories. The…
We construct combinatorial model category structures on the categories of (marked) categories and (marked) pre-additive categories, and we characterize (marked) additive categories as fibrant objects in a Bousfield localization of…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
This paper introduces the concept of gluing in a general category, enabling us to define categories that admit glued-up objects. To achieve this, we introduce the notion of a gluing index category. Subsequently, we provide an entirely…
A category of FI type is one which is sufficiently similar to finite sets and injections so as to admit nice representation stability results. Several common examples admit a Grothendieck fibration to finite sets and injections. We begin by…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
In this paper, I establish the categorical structure necessary to interpret dependent inductive and coinductive types. It is well-known that dependent type theories \`a la Martin-L\"of can be interpreted using fibrations. Modern theorem…
We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…
We show how to treat families of $\infty$-categories fibered in categorical patterns (e.g., $\infty$-operads and monoidal $\infty$-categories) in terms of fibrations by relativizing the Grothendieck construction. As applications, we…
A common technique for producing a new model category structure is to lift the fibrations and weak equivalences of an existing model structure along a right adjoint. Formally dual but technically much harder is to lift the cofibrations and…