中文
相关论文

相关论文: A topological counterpart of well-founded trees in…

200 篇论文

In the context of dependent type theory, we show that coinductive predicates have an equivalent topological counterpart in terms of coinductively generated positivity relations, introduced by G. Sambin to represent closed subsets in…

逻辑 · 数学 2024-04-05 Pietro Sabelli

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for…

逻辑 · 数学 2023-03-31 Steve Awodey , Nicola Gambino , Kristina Sojakova

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

计算机科学中的逻辑 · 计算机科学 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

We define a simple kind of higher inductive type generalising dependent $W$-types, which we refer to as $W$-types with reductions. Just as dependent $W$-types can be characterised as initial algebras of certain endofunctors (referred to as…

范畴论 · 数学 2018-02-22 Andrew Swan

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

计算机科学中的逻辑 · 计算机科学 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Marcelo P. Fiore , Andrew M. Pitts , S. C. Steenkamp

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…

计算机科学中的逻辑 · 计算机科学 2016-05-10 Henning Basold , Herman Geuvers

We present a construction of W-types in the setoid model of extensional Martin-L\"of type theory using dependent W-types in the underlying intensional theory. More precisely, we prove that the internal category of setoids has initial…

逻辑 · 数学 2023-06-22 Jacopo Emmenegger

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

计算机科学中的逻辑 · 计算机科学 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…

逻辑 · 数学 2015-04-22 Steve Awodey , Nicola Gambino , Kristina Sojakova

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

编程语言 · 计算机科学 2026-05-20 Maximilian Doré

Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…

范畴论 · 数学 2016-07-26 Valery Isaev

Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondence between Martin-Lofs constructive type theory and abstract homotopy theory. We have a powerful interplay between these disciplines - we can…

计算机科学中的逻辑 · 计算机科学 2014-02-10 Kristina Sojakova

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

计算机科学中的逻辑 · 计算机科学 2024-01-30 C. B. Aberlé

The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…

范畴论 · 数学 2021-10-07 Chaitanya Leena Subramaniam

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

逻辑 · 数学 2020-07-08 Peter LeFanu Lumsdaine , Mike Shulman

There are multiple ways to formalise the metatheory of type theory. For some purposes, it is enough to consider specific models of a type theory, but sometimes it is necessary to refer to the syntax, for example in proofs of canonicity and…

计算机科学中的逻辑 · 计算机科学 2019-07-18 Ambrus Kaposi , András Kovács , Nicolai Kraus

Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…

计算机科学中的逻辑 · 计算机科学 2023-12-25 Greta Coraglia , Jacopo Emmenegger

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…

We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…

‹ 上一页 1 2 3 10 下一页 ›