Related papers: Inductive types in homotopy type theory
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…
In Homotopy Type Theory, cohomology theories are studied synthetically using higher inductive types and univalence. This paper extends previous developments by providing the first fully mechanized definition of cohomology rings. These rings…
Typology is a subfield of linguistics that focuses on the study and classification of languages based on their structural features. Unlike genealogical classification, which examines the historical relationships between languages, typology…
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…
In the study of homology cobordisms, knot concordance and link concordance, the following technical problem arises frequently: let $\pi$ be a group and let $M \to N$ be a homomorphism between projective $\Z[\pi]$-modules such that $\Z_p…
We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is…
We regard the classification of rational homotopy types as a problem in algebraic deformation theory: any space with given cohomology is a perturbation, or deformation, of the "formal" space with that cohomology. The classifying space is…
This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…
Recently we presented a concise survey of the formulation of the induction and coinduction principles, and some concepts related to them, in programming languages type theory and four other mathematical disciplines. The presentation in type…
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,…
Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their…
Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…
We exploit (co)inductive specifications and proofs to approach the evaluation of low-level programs for the Unlimited Register Machine (URM) within the Coq system, a proof assistant based on the Calculus of (Co)Inductive Constructions type…
The aim of this paper is to connect two important and apparently unrelated theories: motivic homotopy theory and ramification theory. We construct motivic homotopy categories over a qcqs base scheme $S$, in which cohomology theories with…
We use the diagram-free approach to regularity structures introduced by Otto et. al. to build rough paths based on multi-indices. We identify the analogue of the insertion pre-Lie algebra of trees and use it to build the corresponding group…
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…
In this work we study the induction theory for Hopf group coalgebra. To reach this goal we define a substructure B of a Hopf group coalgebra $H$, called subHopf group coalgebra. Also, we introduced the definition of Hopf group suboalgebra…
Our main result states that for each finite complex L the category ${\bf TOP}$ of topological spaces possesses a model category structure (in the sense of Quillen) whose weak equivalences are precisely maps which induce isomorphisms of all…
Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…