English
Related papers

Related papers: Constructing Infinitary Quotient-Inductive Types

200 papers

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

In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in…

Logic in Computer Science · Computer Science 2007-05-23 Marino Miculan

We study the Jacobi-Trudi-type determinant which is conjectured to be the q-character of a certain, in many cases irreducible, finite-dimensional representation of the quantum affine algebra of type C_n. Like the D_n case studied by the…

Quantum Algebra · Mathematics 2007-07-24 Wakako Nakai , Tomoki Nakanishi

We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type…

Logic in Computer Science · Computer Science 2014-06-16 Hugo Herbelin , Arnaud Spiwack

The functorial structure of type constructors is the foundation for many definition and proof principles in higher-order logic (HOL). For example, inductive and coinductive datatypes can be built modularly from bounded natural functors…

Logic in Computer Science · Computer Science 2023-06-22 Basil Fürer , Andreas Lochbihler , Joshua Schneider , Dmitriy Traytel

We show that equivariant tilting modules over equivariant algebras induce equivalences of derived factorization categories. As an application, we show that the derived category of a noncommutative resolution of a linear section of a…

Algebraic Geometry · Mathematics 2021-06-03 Yuki Hirano

While methods of code abstraction and reuse are widespread and well researched, methods of proof abstraction and reuse are still emerging. We consider the use of dependent types for this purpose, introducing a completely mechanical approach…

Programming Languages · Computer Science 2012-08-03 Christopher Schwaab , Jeremy G. Siek

In this paper we describe a family of isomorphism invariants of a finitely generated Coxeter group W. Each of these invariants is the isomorphism type of a quotient group W/N of W by a characteristic subgroup N. The virtue of these…

Group Theory · Mathematics 2007-05-23 Michael Mihalik , John Ratcliffe , Steven Tschantz

For an interval finite quiver $Q$, we introduce a class of flat representations. We classify the indecomposable projective objects in the category $\mathrm{rep}(Q)$ of pointwise finite dimensional representations. We show that an object in…

Representation Theory · Mathematics 2019-10-23 Pengjie Jiao

We give a set of sufficient conditions for a Laurent polynomial to be the q-character of a finite-dimensional irreducible representation of a quantum affine group. We use this result to obtain an explicit path description of q-characters…

Quantum Algebra · Mathematics 2012-12-07 E. Mukhin , C. A. S. Young

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…

Category Theory · Mathematics 2024-12-18 Thibaut Benjamin , Ioannis Markakis , Chiara Sarti

We classify all essential extensions of the form $$0 \rightarrow \W \rightarrow \D \rightarrow A \rightarrow 0$$ where $\W$ is the unique separable simple C*-algebra with a unique tracial state, with finite nuclear dimension and with…

Operator Algebras · Mathematics 2020-06-02 Huaxin Lin , Ping Wong Ng

Categories with families (CwFs) have been used to define the semantics of type theory in type theory. In the setting of Homotopy Type Theory (HoTT), one of the limitations of the traditional notion of CwFs is the requirement to set-truncate…

Logic in Computer Science · Computer Science 2025-12-10 Thorsten Altenkirch , Ambrus Kaposi , Szumi Xie

We introduce $\infty$-type theories as an $\infty$-categorical generalization of the categorical definition of type theories introduced by the second named author. We establish analogous results to the previous work including the…

Category Theory · Mathematics 2022-05-03 Hoang Kim Nguyen , Taichi Uemura

In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

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…

Programming Languages · Computer Science 2025-11-18 Niyousha Najmaei , Niels van der Weide , Benedikt Ahrens , Paige Randall North

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

Starting from involutive BE algebras, we redefine the orthomodular algebras, by introducing the notion of implicative-orthomodular algebras. We investigate properties of implicative-orthomodular algebras, and give characterizations of these…

Logic · Mathematics 2024-01-09 Lavinia Corina Ciungu

Cyclic proof theory breaks tradition by allowing certain infinite proofs: those that can be represented by a finite graph, while satisfying a soundness condition. We reconcile cyclic proofs with traditional finite proofs: we extend abstract…

Logic in Computer Science · Computer Science 2026-02-13 Lide Grotenhuis , Daniël Otten