English
Related papers

Related papers: Quotient inductive-inductive types

200 papers

Motivated by the great success of classical generative models in machine learning, enthusiastic exploration of their quantum version has recently started. To depart on this journey, it is important to develop a relevant metric to evaluate…

Quantum Physics · Physics 2024-08-22 Akira Sone , Akira Tanji , Naoki Yamamoto

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

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

Logic in Computer Science · Computer Science 2024-05-07 Jose Meseguer

We define inductively a sequence of purely algebraic invariants - namely, classes in the Quillen cohomology of the Pi-algebra \pi_* X - for distinguishing between different homotopy types of spaces. Another sequence of such cohomology…

Algebraic Topology · Mathematics 2009-10-31 David Blanc

Higher homotopies are nowadays playing a prominent role in mathematics as well as in certain branches of theoretical physics. We recall some of the connections between the past and the present developments. Higher homotopies were isolated…

Algebraic Topology · Mathematics 2013-03-12 Johannes Huebschmann

A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…

Programming Languages · Computer Science 2024-04-09 Jonathan Chan , Stephanie Weirich

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

Quantum supermaps provide a framework in which higher order quantum processes can act on lower order quantum processes. In doing so, they enable the definition and analysis of new quantum protocols and causal structures. Recently, key…

Quantum Physics · Physics 2021-09-16 Matt Wilson , Giulio Chiribella

In the impredicative type theory of System F ({\lambda}2), it is possible to create inductive data types, such as natural numbers and lists. It is also possible to create coinductive data types such as streams. They work well in the sense…

Logic in Computer Science · Computer Science 2025-05-21 Steven Bronsveld , Herman Geuvers , Niels van der Weide

In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory…

Logic in Computer Science · Computer Science 2024-12-18 Frederik Lerbjerg Aagaard , Magnus Baunsgaard Kristensen , Daniel Gratzer , Lars Birkedal

To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…

Logic in Computer Science · Computer Science 2026-05-01 Bastiaan Laarakker , Daniël Otten , Benno van den Berg

We propose a definition of higher inductive types in $(\infty,1)$-categories with finite limits. We show that the $(\infty,1)$-category of $(\infty,1)$-categories with higher inductive types is finitarily presentable. In particular, the…

Category Theory · Mathematics 2024-10-24 Taichi Uemura

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 combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

Category Theory · Mathematics 2023-07-21 Paige Randall North , Maximilien Péroux

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…

Logic · Mathematics 2017-04-18 Nicolai Kraus , Christian Sattler

We present a new game semantics for Martin-L\"of type theory (MLTT), our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families of a novel variant of games, which induces a…

Logic in Computer Science · Computer Science 2021-06-18 Norihiro Yamada

For any ring $A$ and a small, preadditive, Hom-finite, and locally bounded category $Q$ that has a Serre functor and satisfies the (strong) retraction property, we show that the category of additive functors from $Q$ to the category of…

Representation Theory · Mathematics 2021-01-18 Henrik Holm , Peter Jorgensen

Let G be a semisimple algebraic group over a field k. We introduce the higher Tits indices of G as the set of all Tits indices of G over all field extensions K/k. In the context of quadratic forms this notion coincides with the notion of…

Algebraic Geometry · Mathematics 2008-01-16 Viktor Petrov , Nikita Semenov

Presheaf models of dependent type theory have been successfully applied to model HoTT, parametricity, and directed, guarded and nominal type theory. There has been considerable interest in internalizing aspects of these presheaf models,…

Logic in Computer Science · Computer Science 2024-08-07 Andreas Nuyts , Dominique Devriese

It is well known that univalence is incompatible with uniqueness of identity proofs (UIP), the axiom that all types are h-sets. This is due to finite h-sets having non-trivial automorphisms as soon as they are not h-propositions. A natural…

Logic in Computer Science · Computer Science 2020-05-04 Christian Sattler , Andrea Vezzosi
‹ Prev 1 4 5 6 7 8 10 Next ›