English
Related papers

Related papers: Internal languages of locally cartesian closed $(\…

200 papers

This paper discusses a Domain Specific Language (DSL) that has been developed to enable implementation of concepts of discrete mathematics. A library of data types and functions provides functionality which is frequently required by users.…

Programming Languages · Computer Science 2013-10-15 Rohit Jha , Alfy Samuel , Ashmee Pawar , M. Kiruthika

Restriction categories provide a categorical framework for partiality. In this paper, we introduce three new categorical theories for partiality: local categories, partial categories, and inclusion categories. The objects of a local…

Category Theory · Mathematics 2025-12-04 Marcello Lanfranchi , Jean-Simon Pacaud Lemay

We construct a functor valued invariant of oriented tangles on certain singular blocks of category O. Parabolic subcategories of these blocks categorify tensor products of various fundamental sl(k) representations. Projective functors…

Quantum Algebra · Mathematics 2007-05-23 Joshua Sussan

For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids. The global sections of these…

Formal Languages and Automata Theory · Computer Science 2015-11-06 Liang-Ting Chen , Henning Urbat

Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…

Category Theory · Mathematics 2020-04-21 Enrico Ghiorzi

We define an elementary $\infty$-topos that simultaneously generalizes an elementary topos and Grothendieck $\infty$-topos. We then prove it satisfies the expected topos theoretic properties, such as descent, local Cartesian closure,…

Category Theory · Mathematics 2022-01-11 Nima Rasekh

First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOLDS), or Aczel's and Belo's dependently typed (intuitionistic) first-order logic (DFOL), may be regarded as logic enriched dependent type…

Logic · Mathematics 2019-10-10 Erik Palmgren

We show that for a coconnective ring spectrum satisfying regularity and flatness assumptions, its algebraic K-theory agrees with that of its $\pi_0$. We prove this as a consequence of a more general devissage result for stable infinity…

K-Theory and Homology · Mathematics 2021-12-30 Robert Burklund , Ishan Levy

A theory of data types based on category theory is presented. We organize data types under a new categorical notion of F,G-dialgebras which is an extension of the notion of adjunctions as well as that of T-algebras. T-algebras are also used…

Programming Languages · Computer Science 2020-10-13 Tatsuya Hagino

We study the variation of the local Langlands correspondence for ${\rm GL}_{n}$ in characteristic-zero families. We establish an existence and uniqueness theorem for a correspondence in families, as well as a recognition theorem for when a…

Number Theory · Mathematics 2020-05-19 Daniel Disegni

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…

Programming Languages · Computer Science 2023-06-22 Max S. New , Daniel R. Licata

This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…

Category Theory · Mathematics 2014-10-17 Michal R. Przybylek

We define and study the $(\infty,2)$-category $\mathbf{Cat}_{\infty}(\mathcal{C})$ of $(\infty,1)$-categories internal to a general $(\infty,1)$-category $\mathcal{C}$ via an associated externalization construction. In the first part, we…

Category Theory · Mathematics 2024-09-24 Raffael Stenzel

We study locally constant coefficients. We first study the theory of homotopy Kan extensions with locally constant coefficients in model categories, and explain how it characterizes the homotopy theory of small categories. We explain how to…

Algebraic Topology · Mathematics 2009-12-12 Denis-Charles Cisinski

We introduce a new form of logical relation which, in the spirit of metric relations, allows us to assign each pair of programs a quantity measuring their distance, rather than a boolean value standing for their being equivalent. The…

Logic in Computer Science · Computer Science 2019-04-30 Ugo Dal Lago , Francesco Gavazzo , Akira Yoshimizu

We prove that commutative semirings in a cartesian closed presentable $\infty$-category, as defined by Groth, Gepner, and Nikolaus, are equivalent to product-preserving functors from the $(2,1)$-category of bispans of finite sets. In other…

Category Theory · Mathematics 2025-05-09 Bastiaan Cnossen , Rune Haugseng , Tobias Lenz , Sil Linskens

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

Logic in Computer Science · Computer Science 2021-02-02 Nicolai Kraus

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

Logic · Mathematics 2021-11-09 Pablo Andújar Guerrero

We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…

Representation Theory · Mathematics 2022-03-18 Tashi Walde

For a language $L$, we consider its cyclic closure, and more generally the language $C^k(L)$, which consists of all words obtained by partitioning words from $L$ into $k$ factors and permuting them. We prove that the classes of ET0L and…

Formal Languages and Automata Theory · Computer Science 2016-05-31 Tara Brough , Laura Ciobanu , Murray Elder , Georg Zetzsche