Combinatorial realizability models of type theory
From MaRDI portal
(Redirected from Publication:385804)
Abstract: We introduce a new model construction for Martin-L"{o}f intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines the syntactic model with a notion of realizability; it also encompasses the well-known Hofmann- Streicher groupoid semantics. As our main application, we use the model to analyse the syntactic groupoid associated to the type theory generated by a graph G, showing that it has the same homotopy type as the free groupoid generated by G.
Recommendations
Cites work
- scientific article; zbMATH DE number 1241699 (Why is no real title available?)
- scientific article; zbMATH DE number 1302059 (Why is no real title available?)
- Intensional interpretations of functionals of finite type I
- Internal type theory
- Martin-Löf complexes
- The identity type weak factorisation system
- Type theory and homotopy
Cited in
(9)- Homotopy type theory and Voevodsky's univalent foundations
- scientific article; zbMATH DE number 6694181 (Why is no real title available?)
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- Models of HoTT and the Constructive View of Theories
- scientific article; zbMATH DE number 1841819 (Why is no real title available?)
- Martin-Löf complexes
- Univalence for inverse diagrams and homotopy canonicity
- The least subtopos containing the discrete skeleton of \(\Omega\)
- A completeness result for a realisability semantics for an intersection type system
This page was built for publication: Combinatorial realizability models of type theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385804)