Related papers: Categorical models of subtyping
We study the interaction of structural subtyping with parametric polymorphism and recursively defined type constructors. Although structural subtyping is undecidable in this setting, we describe a notion of parametricity for type…
We introduce fibred type-theoretic fibration categories which are fibred categories between categorical models of Martin-L\"{o}f type theory. Fibred type-theoretic fibration categories give a categorical description of logical predicates…
We define a new model structure on the category of small categories, which is intimately related to the notion of coverings and fundamental groups of small categories. Fibrant objects in the model structure coincide with groupoids, and the…
Fibrations over a category $B$, introduced to category theory by Grothendieck, encode pseudo-functors $B^{op} \rightsquigarrow {\bf Cat}$, while the special case of discrete fibrations encode presheaves $B^{op} \to {\bf Set}$. A two-sided…
We develop a categorical framework for reasoning about abstract properties of differentiation, based on the theory of fibrations. Our work encompasses the first-order fragments of several existing categorical structures for differentiation,…
Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…
We present a type theory dealing with non-linear, "ordinary" dependent types (which we will call cartesian) and linear types, where both constructs may depend on terms of the former. In the interplay between these, we find new type formers…
If a Quillen model category can be specified using a certain logical syntax (intuitively, ``is algebraic/combinatorial enough''), so that it can be defined in any category of sheaves, then the satisfaction of Quillen's axioms over any site…
We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…
Classification questions are often about understanding components of a category. It is much more desirable however to be able to understand the entire homotopy type of this category and not just the set of its components. In this paper we…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
We develop a cofibrantly generated model category structure in the category of topological spaces in which weak equivalences are A-weak equivalences and such that the generalized CW(A)-complexes are cofibrant objects. With this structure…
We define a homotopy relation between arrows of a category with weak equivalences, and give a condition under which the quotient by the homotopy relation yields the homotopy category. In the case of the fibrant-cofibrant objects of a model…
We propose a simplified definition of Quillen's fibration sequences in a pointed model category that fully captures the theory, although it is completely independent of the concept of action. This advantage arises from the understanding…
In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…
We propose foundations for a synthetic theory of $(\infty,1)$-categories within homotopy type theory. We axiomatize a directed interval type, then define higher simplices from it and use them to probe the internal categorical structures of…
The present paper gives a generalization of cartesian closed categories, called cartesian closed categories with dependence, whose strict version induces categories with families that support 1-, Sigma- and Pi-types in the strict sense.…
We investigate how to characterize subcategories of abelian categories in terms of intrinsic axioms. In particular, we find intrinsic axioms which characterize generating cogenerating functorially finite subcategories, precluster tilting…
Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…
Generalized linear and additive models are very efficient regression tools but the selection of relevant terms becomes difficult if higher order interactions are needed. In contrast, tree-based methods also known as recursive partitioning…