Inductive Types in Homotopy Type Theory

LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science(2012)

引用 57|浏览1
暂无评分
摘要
Homotopy type theory is an interpretation of Martin-Löf's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof scripts for this verification form an essential component of this research.
更多
查看译文
关键词
algebra,programming language semantics,topology,trees (mathematics),type theory,Coq proof assistant,Martin-Lof constructive type theory,W-types,abstract homotopy theory,algebraic topology,computational approach,constructive mathematics,homotopical semantics,homotopy type theory,inductive type,intensional system,proof script,topological semantics,type theory-based proof assistant,well-founded trees,Type theory,homotopy theory,initial algebras
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要