arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.4716cs.LOcs.PL
收藏

论述谓类型论中的无关性和语义平等性

On Irrelevance and Algorithmic Equality in Predicative Type Theory

Andreas Abel, Gabriel Scherer

摘要:

依赖类型的程序包含了大量的静态项,这些静态项对于类型检查器是必要的,但对于计算是无关的。为了区分静态代码和动态代码,提出了几种静态分析和类型系统。我们认为Pfenning的类型论与不相关的量化是兼容的类型为基础的平等的概念,尊重等法律。我们将Pfenning的理论扩展到宇宙和大消除,并发展其元理论。通过Kripke模型在类型化的等式判断上得到主题约简、规范化和一致性。最后,类型导向的平等算法描述其完整性证明了第二个Kripke模型。

英文摘要:

Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been put forward. We consider Pfenning's type theory with irrelevant quantification which is compatible with a type-based notion of equality that respects eta-laws. We extend Pfenning's theory to universes and large eliminations and develop its meta-theory. Subject reduction, normalization and consistency are obtained by a Kripke model over the typed equality judgement. Finally, a type-directed equality algorithm is described whose completeness is proven by a second Kripke model.

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

↑