English
Related papers

Related papers: Displayed Type Theory and Semi-Simplicial Types

200 papers

We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…

Logic in Computer Science · Computer Science 2026-03-25 Daniel Gratzer

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Logic · Mathematics 2020-09-14 Andrej Bauer , Philipp G. Haselwarter , Peter LeFanu Lumsdaine

Homotopy type theory is a modern foundation for mathematics that introduces the univalence axiom and is particularly suitable for the study of homotopical mathematics and its formalization via proof assistants. In order to better comprehend…

Category Theory · Mathematics 2025-08-13 Nima Rasekh

The language of homotopy type theory has proved to be appropriate as an internal language for various higher toposes, for example with Synthetic Algebraic Geometry for the Zariski topos. In this paper we apply such techniques to the higher…

Logic · Mathematics 2024-12-05 Felix Cherubini , Thierry Coquand , Freek Geerligs , Hugo Moeneclaey

In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…

Algebraic Topology · Mathematics 2018-01-19 Dmitry N. Kozlov

There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…

Algebraic Topology · Mathematics 2021-09-14 Paul Trygsland

The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In…

Programming Languages · Computer Science 2022-09-21 András Kovács

A simplicial set is said to be non-singular if its non-degenerate simplices are embedded. Let $sSet$ denote the category of simplicial sets. We prove that the full subcategory $nsSet$ whose objects are the non-singular simplicial sets…

Algebraic Topology · Mathematics 2020-01-16 Vegard Fjellbo

There have recently been several developments in synthetic mathematics using extensions of dependent type theory with univalence and higher inductive types: simplicial homotopy type theory, synthetic algebraic geometry and synthetic Stone…

Logic in Computer Science · Computer Science 2026-05-19 Thierry Coquand , Jonas Höfer , Christian Sattler

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

We propose a generalization of Sullivan's de Rham homotopy theory to non-simply connected spaces. The formulation is such that the real homotopy type of a manifold should be the closed tensor dg-category of flat bundles on it much the same…

Algebraic Topology · Mathematics 2020-03-09 Syunji Moriya

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

Logic · Mathematics 2021-12-02 Philipp G. Haselwarter , Andrej Bauer

We present two Dialectica-like constructions for models of intensional Martin-L\"of type theory based on G\"odel's original Dialectica interpretation and the Diller-Nahm variant, bringing dependent types to categorical proof theory. We set…

Category Theory · Mathematics 2021-05-04 Sean K. Moss , Tamara von Glehn

Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…

Logic in Computer Science · Computer Science 2026-03-05 Mariangiola Dezani-Ciancaglini , Besik Dundua , Paola Giannini , Furio Honsell

Let $R$ be a commutative ring with unit. We consider the homotopy theory of the category of spectral sequences of $R$-modules with the class of weak equivalences given by those morphisms inducing a quasi-isomorphism at a certain fixed page.…

Algebraic Topology · Mathematics 2023-02-22 Muriel Livernet , Sarah Whitehouse

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.…

Logic in Computer Science · Computer Science 2025-10-21 Jacob Neumann

Higher inductive-inductive types (HIITs) generalize inductive types of dependent type theories in two ways. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they…

Logic in Computer Science · Computer Science 2023-06-22 Ambrus Kaposi , András Kovács

Shulman's spatial type theory internalizes the modalities of Lawvere's axiomatic cohesion in a homotopy type theory, enabling many of the constructions from Schreiber's modal approach to differential cohomology to be carried out…

Category Theory · Mathematics 2023-02-01 David Jaz Myers , Mitchell Riley

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…

Logic in Computer Science · Computer Science 2016-05-10 Henning Basold , Herman Geuvers

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…

Logic in Computer Science · Computer Science 2014-06-03 Arno Pauly , Matthew de Brecht
‹ Prev 1 3 4 5 6 7 10 Next ›