中文
相关论文

相关论文: Notions of Anonymous Existence in Martin-L\"of Typ…

200 篇论文

We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…

计算机科学中的逻辑 · 计算机科学 2023-04-21 Rafaël Bocquet

In this article the author endows the functor category [B(Z2),Gpd] with the structure of a type-theoretic fibration category with a univalent universe using the so-called injective model structure. It gives us a new model of Martin-L\"of…

范畴论 · 数学 2017-12-12 Anthony Bordg

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…

计算机科学中的逻辑 · 计算机科学 2024-12-17 Matthias Weber

For sensitive text data to be shared among NLP researchers and practitioners, shared documents need to comply with data protection and privacy laws. There is hence a growing interest in automated approaches for text anonymization. However,…

计算与语言 · 计算机科学 2021-03-18 Maximilian Mozes , Bennett Kleinberg

We give a collection of results regarding path types, identity types and univalent universes in certain models of type theory based on presheaves. The main result is that path types cannot be used directly as identity types in any…

逻辑 · 数学 2018-10-18 Andrew Swan

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…

代数几何 · 数学 2015-04-09 V. A. Vassiliev

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

计算机科学中的逻辑 · 计算机科学 2020-10-28 Rafaël Bocquet

Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in…

编程语言 · 计算机科学 2025-11-18 Niyousha Najmaei , Niels van der Weide , Benedikt Ahrens , Paige Randall North

We present techniques for reasoning about constructor classes that (like the monad class) fix polymorphic operations and assert polymorphic axioms. We do not require a logic with first-class type constructors, first-class polymorphism, or…

计算机科学中的逻辑 · 计算机科学 2012-07-16 Brian Huffman

We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Simon Castellan , Pierre Clairambault , Peter Dybjer

Agda is a dependently-typed functional programming language, based on an extension of intuitionistic Martin-L\"of type theory. We implement first order natural deduction in Agda. We use Agda's type checker to verify the correctness of…

逻辑 · 数学 2021-04-12 Louis Warren

Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…

计算机科学中的逻辑 · 计算机科学 2010-01-25 Mark Kaminski , Gert Smolka

We present the 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…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Matthias Weber

Let $k$ be a field, let $H \subset G$ be (possibly disconnected) reductive groups over $k$, and let $\Gamma$ be a finitely generated group. Vinberg and Martin have shown that the induced morphism of character varieties \[…

表示论 · 数学 2024-05-29 Sean Cotner

In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data types. This is due to the combination of impredicativity and…

计算机科学中的逻辑 · 计算机科学 2026-03-05 Herman Geuvers

Let $G$ be a simple algebraic group defined over a finite field of good characteristic, with associated Frobenius endomorphism $F$. In this article we extend an observation of Lusztig, (which gives a numerical relationship between an…

表示论 · 数学 2013-10-17 Jay Taylor

Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…

计算机科学中的逻辑 · 计算机科学 2017-10-31 Simon Huber

We consider several types of non-existence theorems for functors. For example, there are no nontrivial functors from the category of groups (or the category of pointed sets, or vector spaces) to any small category. Another type of questions…

Corporations are retaining ever-larger corpuses of personal data; the frequency or breaches and corresponding privacy impact have been rising accordingly. One way to mitigate this risk is through use of anonymized data, limiting the…

机器学习 · 计算机科学 2016-10-20 Koray Mancuhan , Chris Clifton

In this article we apply ideas from homotopy theory to the study of singular foliations. We verify that a technical lemma remains valid for left semi-model categories. When applied to the category of $L_\infty$-algebroids thanks to the work…

代数拓扑 · 数学 2019-09-04 Yael Fregier , Rigel A. Juarez-Ojeda