Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Modalities in homotopy type theory
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 …
groupoids. It is being developed as a new foundation for mathematics and as an internal …
Topological Quantum Gates in Homotopy Type Theory
Despite the plausible necessity of topological protection for realizing scalable quantum
computers, the conceptual underpinnings of topological quantum logic gates had arguably …
computers, the conceptual underpinnings of topological quantum logic gates had arguably …
Homotopy type theory: Univalent foundations of mathematics
TUF Program - arxiv preprint arxiv:1308.0729, 2013 - arxiv.org
Homotopy type theory is a new branch of mathematics, based on a recently discovered
connection between homotopy theory and type theory, which brings new ideas into the very …
connection between homotopy theory and type theory, which brings new ideas into the very …
Finite sets in homotopy type theory
We study different formalizations of finite sets in homotopy type theory to obtain a general
definition that exhibits both the computational facilities and the proof principles expected …
definition that exhibits both the computational facilities and the proof principles expected …
Homotopy limits in type theory
Working in homotopy type theory, we provide a systematic study of homotopy limits of
diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the …
diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the …
Classifying Types
E Rijke - arxiv preprint arxiv:1906.09435, 2019 - arxiv.org
The study of homotopy theoretic phenomena in the language of type theory is sometimes
loosely calledsynthetic homotopy theory'. Homotopy theory in type theory is only one of the …
loosely calledsynthetic homotopy theory'. Homotopy theory in type theory is only one of the …
[HTML][HTML] The compatibility of the minimalist foundation with homotopy type theory
M Contente, ME Maietti - Theoretical Computer Science, 2024 - Elsevier
Abstract The Minimalist Foundation, MF for short, is a two-level foundation for constructive
mathematics ideated by Maietti and Sambin in 2005 and then fully formalized by Maietti in …
mathematics ideated by Maietti and Sambin in 2005 and then fully formalized by Maietti in …
[PDF][PDF] On small types in univalent foundations
We investigate predicative aspects of constructive univalent foundations. By predicative and
constructive, we respectively mean that we do not assume Voevodsky's propositional …
constructive, we respectively mean that we do not assume Voevodsky's propositional …
[PDF][PDF] A conservativity result for homotopy elementary types in dependent type theory
M Spadetto - arxiv preprint arxiv:2303.05623, 2023 - researchgate.net
We prove a conservativity result for extensional type theories over propositional ones, ie
dependent type theories with propositional computation rules, using insights from homotopy …
dependent type theories with propositional computation rules, using insights from homotopy …
Constructions with non-recursive higher inductive types
N Kraus - Proceedings of the 31st Annual ACM/IEEE Symposium …, 2016 - dl.acm.org
Higher inductive types (HITs) in homotopy type theory are a powerful generalization of
inductive types. Not only can they have ordinary constructors to define elements, but also …
inductive types. Not only can they have ordinary constructors to define elements, but also …