English
Related papers

Related papers: Type refinement and monoidal closed bifibrations

200 papers

We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…

Algebraic Geometry · Mathematics 2017-03-01 Fritz Hörmann

In this article, we develop a notion of Quillen bifibration which combines the two notions of Grothendieck bifibration and of Quillen model structure. In particular, given a bifibration $p:\mathcal E\to\mathcal B$, we describe when a family…

Category Theory · Mathematics 2017-10-02 Pierre Cagne , Paul-André Melliès

We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2)…

Programming Languages · Computer Science 2015-07-03 Niki Vazou , Alexander Bakst , Ranjit Jhala

Layered monoidal theories provide a categorical framework for studying scientific theories at different levels of abstraction, via string diagrammatic algebra. We introduce models for three closely related classes of layered monoidal…

Category Theory · Mathematics 2026-02-27 Leo Lobski , Fabio Zanasi

In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…

Category Theory · Mathematics 2023-05-25 Nicolas Blanco

Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…

Logic in Computer Science · Computer Science 2015-08-04 Paul-André Melliès , Noam Zeilberger

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

This paper defines double fibrations (fibrations of double categories) and describes their key examples and properties. In particular, it shows how double fibrations relate to existing fibrational notions such as monoidal fibrations and…

Category Theory · Mathematics 2022-05-31 Geoffrey Cruttwell , Michael Lambert , Dorette Pronk , Martin Szyld

We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure,…

Category Theory · Mathematics 2018-07-09 Christina Vasilakopoulou

We compare closed and rigid monoidal categories. Closedness is defined by the tensor product having a right adjoint: the internal hom functor. Rigidity, on the other hand, generalises the duality of finite-dimensional vector spaces. In the…

Category Theory · Mathematics 2026-02-06 Sebastian Halbig , Tony Zorman

We extend Homotopy Type Theory with a novel modality that is simultaneously a monad and a comonad. Because this modality induces a non-trivial endomap on every type, it requires a more intricate judgemental structure than previous modal…

Category Theory · Mathematics 2021-02-09 Mitchell Riley , Eric Finster , Daniel R. Licata

In this survey paper we give account of several approaches to the strictification and non-strictification of monoidal categories, which are constructions that turn a monoidal category into a (non-)strict one monoidally equivalent to the…

Category Theory · Mathematics 2024-12-31 Jorge Becerra

Type theories can be formalized using the intrinsically (hard) or the extrinsically (soft) typed style. In large libraries of type theoretical features, often both styles are present, which can lead to code duplication and integration…

Logic in Computer Science · Computer Science 2021-07-19 Florian Rabe , Navid Roux

We give structural results about bifibrations of (internal) $(\infty,1)$-categories with internal sums. This includes a higher version of Moens' Theorem, characterizing cartesian bifibrations with extensive aka stable and disjoint internal…

Category Theory · Mathematics 2024-03-12 Jonathan Weinberger

Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…

Category Theory · Mathematics 2010-02-05 M. R. Gould

We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…

Category Theory · Mathematics 2021-11-12 Youssef Mousaaid , Alistair Savage

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau

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…

Category Theory · Mathematics 2017-09-25 Taichi Uemura

We provide conditions on a monoidal model category $\mathcal{M}$ so that the category of commutative monoids in $\mathcal{M}$ inherits a model structure from $\mathcal{M}$ in which a map is a weak equivalence or fibration if and only if it…

Algebraic Topology · Mathematics 2021-09-14 David White

We present a logically principled foundation for systematizing, in a way that works with any computational effect and evaluation order, SMT constraint generation seen in refinement type systems for functional programming languages. By…

Programming Languages · Computer Science 2023-08-21 Dimitrios J. Economou , Neel Krishnaswami , Jana Dunfield
‹ Prev 1 2 3 10 Next ›