English
Related papers

Related papers: On Higher Inductive Types in Cubical Type Theory

200 papers

We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category $\mathbb{EFF}$. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as…

Category Theory · Mathematics 2018-08-02 Benno van den Berg

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) ->…

Quantum Physics · Physics 2026-03-13 Matt Wilson , James Hefford

The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…

General Topology · Mathematics 2018-04-13 Wanjun Hu

We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…

Category Theory · Mathematics 2023-02-21 Max S. New , Daniel R. Licata

We prove the Hurewicz theorem in homotopy type theory, i.e., that for $X$ a pointed, $(n-1)$-connected type $(n \geq 1)$ and $A$ an abelian group, there is a natural isomorphism $\pi_n(X)^{ab} \otimes A \cong \tilde{H}_n(X; A)$ relating the…

Algebraic Topology · Mathematics 2023-08-02 J. Daniel Christensen , Luis Scoccola

We develop a constructive theory of finite multisets in Homotopy Type Theory, defining them as free commutative monoids. After recalling basic structural properties of the free commutative-monoid construction, we formalise and establish the…

Logic in Computer Science · Computer Science 2023-06-22 Vikraman Choudhury , Marcelo Fiore

When working in Homotopy Type Theory and Univalent Foundations, the traditional role of the category of sets, Set, is replaced by the category hSet of homotopy sets (h-sets); types with h-propositional identity types. Many of the properties…

Logic in Computer Science · Computer Science 2025-02-19 Daniel Gratzer , Håkon Gylterud , Anders Mörtberg , Elisabeth Stenholm

We discuss how canonical and universal constructions, properties and characterizations interact with equality in the framework of Homotopy Type Theory, comparing it with Grothendieck's use of equality and shedding further light on…

Logic · Mathematics 2026-04-02 Thomas Eckl

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

Logic in Computer Science · Computer Science 2016-07-18 Jonathan Sterling

In type theory, coinductive types are used to represent processes, and are thus crucial for the formal verification of non-terminating reactive programs in proof assistants based on type theory, such as Coq and Agda. Currently, programming…

Logic in Computer Science · Computer Science 2018-11-01 Rasmus Ejlers Møgelberg , Niccolò Veltri

Grothendieck toposes, and by extension, logical theories, can be represented by topological structures. Butz and Moerdijk showed that every topos with enough points can be represented as the topos of sheaves on an open topological groupoid.…

Category Theory · Mathematics 2024-08-28 Joshua Wrigley

Higher-dimensional automata, i.e., pointed labeled precubical sets, are a powerful combinatorial-topological model for concurrent systems. In this paper, we show that for every (nonempty) connected polyhedron there exists a shared-variable…

Formal Languages and Automata Theory · Computer Science 2024-04-26 Catarina Faustino , Thomas Kahl , Rodrigo Lopes

Univalence was first defined in the setting of homotopy type theory by Voevodsky, who also (along with Kapulkin and Lumsdaine) adapted it to a model categorical setting, which was subsequently generalized to locally Cartesian closed…

Category Theory · Mathematics 2021-03-31 Nima Rasekh

The concepts of topology have a profound impact on physics research spanning the fields of condensed matter, photonics and acoustics and predicting topological states that provide unprecedented versatility in routing and control of waves of…

Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…

Programming Languages · Computer Science 2024-10-25 Philipp Jan Andries Stassen , Rasmus Ejlers Møgelberg , Maaike Zwart , Alejandro Aguirre , Lars Birkedal

Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. Although it can be treated purely as an algebraic subject, it is inherently topological in nature: the…

Category Theory · Mathematics 2007-05-23 Tom Leinster

Techniques from higher categories and higher-dimensional rewriting are becoming increasingly important for understanding the finer, computational properties of higher algebraic theories that arise, among other fields, in quantum…

Category Theory · Mathematics 2017-01-04 Amar Hadzihasanovic

Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…

Category Theory · Mathematics 2025-12-05 Drew Flieder

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore
‹ Prev 1 8 9 10 Next ›