arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.04759cs.LO
收藏

关于作为计算路类型的恒等式

On the Identity Type as the Type of Computational Paths

Arthur F. Ramos, Ruy J. G. B. de Queiroz, Anjolina G. de Oliveira

摘要:

我们引入了一种新的方式形式化的内涵的身份类型的基础上,一个实体被称为计算路径可以被解释为身份类型的条款。我们的方法得益于我们的消除规则易于理解和使用。我们明确这一点,构造一些相关类型的条款,使用我们提出的消除规则。我们还表明,身份类型,我们的方法所定义的,诱导广群结构。这个结果与Hofmann \& Streicher(1994)揭示的传统的恒等式诱导群胚的事实是一致的。

英文摘要:

We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is easy to understand and use. We make this point clear constructing terms of some relevant types using our proposed elimination rule. We also show that the identity type, as defined by our approach, induces a groupoid structure. This result is on par with the fact that the traditional identity type induces a groupoid, as exposed by Hofmann \& Streicher (1994).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑