Reference. When is the partial map classifier a Sierpiński cone?

Cite

Cite as @pugh-2025-when (helia, typst) · \cite{pugh-2025-when} (LaTeX)
BibTeX
bibtex · 1 line
@inproceedings{pugh-2025-when, title={When is the partial map classifier a Sierpiński cone?}, url={http://dx.doi.org/10.1109/lics65433.2025.00060}, DOI={10.1109/lics65433.2025.00060}, booktitle={2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}, publisher={IEEE}, author={Pugh, Leoni and Sterling, Jonathan}, year={2025}, month=June, pages={718–731} }
hayagriva YAML (typst)
yaml · 14 lines
pugh-2025-when:
  type: article
  title: When is the partial map classifier a Sierpiński cone?
  author:
  - Pugh, Leoni
  - Sterling, Jon
  date: 2025-06
  page-range: 718-731
  serial-number:
    doi: 10.1109/lics65433.2025.00060
  parent:
    type: proceedings
    title: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    publisher: IEEE
Cited by (2)

The Yoneda embedding in simplicial type theory gratzer-2025-the

DOI · arXiv

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.
arXiv
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.
arXiv

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.
DOI · arXiv

Homotopy Type Theory: Univalent Foundations of Mathematics hottbook

Web · arXiv

An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory fiore_plotkin_1997

DOI
External (35)
pugh-2025-when reference entries/refs/pugh-2025-when/pugh-2025-when.hel