Reference. When is the partial map classifier a Sierpiński cone?
Cite
Cited by (2)
The Yoneda embedding in simplicial type theory gratzer-2025-the
Directed univalence in simplicial homotopy type theory gratzer-2024-directed
Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics – where it allows for synthetic (higher) category theory – and programming languages – where it leads to a directed version of the structure identity principle. In this work, we construct the first types in simplicial type theory with non-trivial homomorphisms. We extend simplicial type theory with modalities and new reasoning principles to obtain triangulated type theory in order to construct the universe of discrete types . We prove that homomorphisms in this type correspond to ordinary functions of types i.e., that is directed univalent. The construction of is foundational for both of the aforementioned applications of simplicial type theory. We are able to define several crucial examples of categories and to recover important results from category theory. Using , we are also able to define various types whose usage is guaranteed to be functorial. These provide the first complete examples of the proposed directed structure identity principle.
Cites 39 works (4 here)
With notes (4)
Directed univalence in simplicial homotopy type theory gratzer-2024-directed
Simplicial type theory extends homotopy type theory with a directed path type which internalizes the notion of a homomorphism within a type. This concept has significant applications both within mathematics – where it allows for synthetic (higher) category theory – and programming languages – where it leads to a directed version of the structure identity principle. In this work, we construct the first types in simplicial type theory with non-trivial homomorphisms. We extend simplicial type theory with modalities and new reasoning principles to obtain triangulated type theory in order to construct the universe of discrete types . We prove that homomorphisms in this type correspond to ordinary functions of types i.e., that is directed univalent. The construction of is foundational for both of the aforementioned applications of simplicial type theory. We are able to define several crucial examples of categories and to recover important results from category theory. Using , we are also able to define various types whose usage is guaranteed to be functorial. These provide the first complete examples of the proposed directed structure identity principle.
Modalities in homotopy type theory rijke-2020-modalities
Univalent homotopy type theory (HoTT) may be seen as a language for the category of -groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the theory of factorization systems, reflective subuniverses, and modalities in homotopy type theory, including their construction using a “localization” higher inductive type. This produces in particular the (-connected, -truncated) factorization system as well as internal presentations of subtoposes, through lex modalities. We also develop the semantics of these constructions.
An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory fiore_plotkin_1997
External (35)
- Non‐accessible localizations (2024)
- Synthetic fibered (∞,1)-category theory (2023)
- Tensorial structure of the lifting doctrine in constructive domain theory (2023)
- Domain theory in constructive and predicative univalent foundations (2023)
- The simplicial model of Univalent Foundations (after Voevodsky) (2021)
- Using displayed univalent graphs to formalize higher groups in univalent foundations (2021)
- Higher groups via displayed univalent reflexive graphs in cubical type theory (2020)
- All (∞, l)-toposes have strict univalent universes (2019)
- Polynomial pseudomonads and dependent type theory (2018)
- A type theory for synthetic oo-categories (2017)
- Using the internal language of toposes in algebraic geometry (2017)
- The Coq Proof Assistant Reference Manual (2016)
- Natural models of homotopy type theory (2016)
- The Lean Theorem Prover (System Description) (2015)
- A synthetic theory of sequential domains (2012)
- Polynomial functors and polynomial monads (2012)
- Dependently typed programming in Agda (2009)
- Computational adequacy for recursive types in models of intuitionistic set theory (2004)
- The fixed point property in synthetic domain theory (2002)
- Complete cuboidal sets in axiomatic domain theory (2002)
- A model for the homotopy theory of homotopy theory (2001)
- General synthetic domain theory – a logical approach (1999)
- Inductive Construction of Repletion (1999)
- The Category of Cpos From a Synthetic Viewpoint (1997)
- Studying Repleteness in the Category of Cpos (1997)
- Algebraic Set Theory (1995)
- Realizability toposes and language semantics (1995)
- Axiomatic domain theory in categories of partial maps (1994)
- Naïve synthetic domain theory — a logical approach (1993)
- Extensional PERs (1992)
- Models for Smooth Infinitesimal Analysis (1991)
- Domain theory in realizability toposes (1991)
- First steps in synthetic domain theory (1991)
- Continuity and effectiveness in topoi (1986)
- Sur les modèles de la géométrie différentielle synthétique (1979)