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

非谓词排序中的参数性

Parametricity in an Impredicative Sort

Chantal Keller, Marc Lasson

摘要:

现在,对于一大类类型系统来说,Escherichold的抽象定理是一个很好的结果。本文给出了关系参量化的定义,并证明了Coq的基本形式语言归纳构造演算(CIC)中的抽象定理,其中参量化关系的余域是命题的非谓词类。为了继续下去,我们需要通过拆分排序层次结构来细化这个演算,以便将信息性术语与非信息性术语分开。这种细化非常接近CIC,但具有键入判断可以区分信息项的属性。在许多应用中,CIC内部的参数性的自然编码既有理论目的(证明命题相对于逻辑系统的独立性),也有实践目的(证明有限代数结构的性质)。最后,我们讨论了如何在我们的演算之上简单地构建一个新的自反Coq策略,该策略通过参数化来构造证明项。

英文摘要:

Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions (CIC), the underlying formal language of Coq, in which parametricity relations' codomain is the impredicative sort of propositions. To proceed, we need to refine this calculus by splitting the sort hierarchy to separate informative terms from non-informative terms. This refinement is very close to CIC, but with the property that typing judgments can distinguish informative terms. Among many applications, this natural encoding of parametricity inside CIC serves both theoretical purposes (proving the independence of propositions with respect to the logical system) as well as practical aspirations (proving properties of finite algebraic structures). We finally discuss how we can simply build, on top of our calculus, a new reflexive Coq tactic that constructs proof terms by parametricity.

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

↑