English
Related papers

Related papers: Formalizing two-level type theory with cofibrant e…

200 papers

Non notherian Formal schemes of perfectoid type (for example $\mathbb{Z}_p[p^{1/p^\infty}]\langle X^{1/p^\infty} \rangle$ along with its multivariate version) with rational degree are constructed and are shown to be admissible. These formal…

Algebraic Geometry · Mathematics 2019-07-05 Harpreet Singh Bedi

In recent years, Homotopy Type Theory (HoTT) has had great success both as a foundation of mathematics and as internal language to reason about $\infty$-groupoids (a.k.a. spaces). However, in many areas of mathematics and computer science,…

Logic in Computer Science · Computer Science 2026-02-20 Fernando Rafael Chu Rivera , Paige Randall North

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Logic in Computer Science · Computer Science 2023-07-20 Peter Hanukaev , Harley Eades

Derived D-Geometry is considered as a convenient language for a coordinate-free investigation of nonlinear partial differential equations up to symmetries. One of the first issues one meets in the functor of points approach to derived…

Algebraic Topology · Mathematics 2017-02-07 Gennaro di Brino , Damjan Pistalo , Norbert Poncin

The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…

Rings and Algebras · Mathematics 2014-02-19 Anastasis Kratsios

We present the type system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2024-12-17 Matthias Weber

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Logic in Computer Science · Computer Science 2024-02-26 Sara Ayhan

We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type…

Logic in Computer Science · Computer Science 2021-12-14 Deivid Vale , Niels van der Weide

We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky

We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…

Logic in Computer Science · Computer Science 2023-03-24 Sebastián Urciuoli

We define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

Datatype-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed over the years, most of them for Haskell, but…

Programming Languages · Computer Science 2012-02-15 José Pedro Magalhães , Andres Löh

We extend the 2-representation theory of finitary 2-categories to certain 2-categories with infinitely many objects, denoted locally finitary 2-categories, and extend the classical classification results of simple transitive…

Category Theory · Mathematics 2022-01-19 James Macpherson

In their work on second-order equational logic, Fiore and Hur have studied presentations of simply typed languages by generating binding constructions and equations among them. To each pair consisting of a binding signature and a set of…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , André Hirschowitz , Ambroise Lafont , Marco Maggesi

The following strong form of density of definable types is introduced for theories T admitting a fibered dimension function d: given a model M of T and a definable subset X of M^n, there is a definable type p in X, definable over a code for…

Logic · Mathematics 2019-09-18 Quentin Brouette , Pablo Cubides Kovacsics , Francoise Point

The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose $F^\omega_{..}$, a rigorous…

Programming Languages · Computer Science 2021-07-06 Sandro Stucki , Paolo G. Giarrusso

We determine the endomorphism categories of cell 2-representations of fiat 2-categories associated with strongly regular two-sided cells under some natural assumptions. Along the way, we completely describe J-simple fiat 2-categories which…

Representation Theory · Mathematics 2025-11-10 Volodymyr Mazorchuk , Vanessa Miemietz

We describe a non-extensional variant of Martin-L\"of type theory which we call two-dimensional type theory, and equip it with a sound and complete semantics valued in 2-categories.

Logic · Mathematics 2011-10-17 Richard Garner

We construct a 2-category of differential graded schemes. The local affine models in this theory are differential graded algebras, which are graded commutative with unit over a field of characteristic zero, are concentrated in non-positive…

Algebraic Geometry · Mathematics 2007-05-23 Kai Behrend

In this article we develop formal category theory within augmented virtual double categories. Notably we formalise the classical notions of Kan extension, Yoneda embedding $\text y_A\colon A \to \hat A$, exact square, total category and…

Category Theory · Mathematics 2024-04-04 Seerp Roald Koudenburg