English
Related papers

Related papers: The Theory of an Arbitrary Higher $\lambda$-Model

200 papers

We introduce the notion of algebraic fibrant objects in a general model category and establish a (combinatorial) model category structure on algebraic fibrant objects. Based on this construction we propose algebraic Kan complexes as an…

Algebraic Topology · Mathematics 2011-05-31 Thomas Nikolaus

We classify (up to quasi-isomorphism) the free differential modules whose homology is equal to a given module $M$ by developing a theory for deforming an arbitrary free complex into a differential module. We use an iterative approach to…

Commutative Algebra · Mathematics 2023-08-07 Maya Banks , Keller VandeBogert

This paper introduces Relational Type Theory (RelTT), a new approach to type theory with extensionality principles, based on a relational semantics for types. The type constructs of the theory are those of System F plus relational…

Logic in Computer Science · Computer Science 2021-01-26 Aaron Stump , Benjamin Delaware , Christopher Jenkins

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

This is the second in a series of papers extending Martin-L\"{o}f's meaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I,…

Logic in Computer Science · Computer Science 2017-04-28 Carlo Angiuli , Robert Harper

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…

Logic in Computer Science · Computer Science 2018-04-27 Arthur Freitas Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

We prove an analogue of the Tate conjecture on homomorphisms of abelian varieties over infinite cyclotomic extensions of finitely generated fields of characteristic zero.

Number Theory · Mathematics 2015-05-18 Yuri G. Zarhin

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$.…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

This article investigates the homotopy theory of simplicial commutative algebras with a view to homological applications.

Commutative Algebra · Mathematics 2016-02-11 Z. Arvasi , E. Ulualan , E. Uslu

To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary…

Logic in Computer Science · Computer Science 2015-12-18 Leonardo de Moura , Jeremy Avigad , Soonho Kong , Cody Roux

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of…

Logic in Computer Science · Computer Science 2017-10-09 Lars Birkedal , Aleš Bizjak , Ranald Clouston , Hans Bugge Grathwohl , Bas Spitters , Andrea Vezzosi

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

In the Simply Typed $\lambda$-calculus Statman investigates the reducibility relation $\leq_{\beta\eta}$ between types: for $A,B \in \mathbb{T}^0$, types freely generated using $\rightarrow$ and a single ground type $0$, define $A…

Logic in Computer Science · Computer Science 2023-06-22 Bram Westerbaan , Bas Westerbaan , Rutger Kuyper , Carst Tankink , Remy Viehoff , Henk Barendregt

The homotopy theory of representations of nets of algebras over a (small) category with values in a closed symmetric monoidal model category is developed. We illustrate how each morphism of nets of algebras determines a change-of-net…

Mathematical Physics · Physics 2023-03-23 Angelos Anastopoulos , Marco Benini

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 describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2017-05-12 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

$\tau$-tilting theory can be thought of as a generalization of the classical tilting theory which allows mutations at any indecomposable summand of a support $\tau$-tilting pair. Indeed, for any algebra $\Lambda$ its tilting modules…

Representation Theory · Mathematics 2025-12-17 Jonah Berggren , Khrystyna Serhiyenko

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker