natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
The James construction type is an axiomatization of the James construction in the context of homotopy type theory.
As a higher inductive type, the James construction type of a pointed type is given by the following constructors
In Coq pseudocode this becomes
Inductive JamesConstruction (A : PointedType) : Type
| epsilon : JamesConstruction A
| alpha : A -> JamesConstruction A -> JamesConstruction A
| delta : forall (x : JamesConstruction A) x = alpha point x
We can see that is simply the free monoid on . The higher inductive type is recursive which can make it difficult to study. This however can be remedied by defining a sequence of types together with maps such that the type defined as the sequential colimit of is equivalent to .
There is an equivalence of types if is 0-connected.
Guillaume Brunerie, On the homotopy groups of spheres in homotopy type theory (arxiv:1606.05916)
Peter LeFanu Lumsdaine, Mike Shulman, Semantics of higher inductive types (arXiv:1705.07088)
Guillaume Brunerie, The James construction and in homotopy type theory (arXiv:1710.10307)
Last revised on January 25, 2023 at 04:24:59. See the history of this page for a list of all contributions to it.