arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.00731cs.LO
收藏

系统F的棒递归解释

An interpretation of system F through bar recursion

Valentin Blot

摘要:

二阶算术有两种可能的计算解释:Girard的系统F或Spector的棒递归及其变体。虽然逻辑是相同的,但从这两种解释中获得的程序具有根本不同的计算行为,并且它们的关系还没有得到很好的理解。我们通过将系统F的第一个翻译定义为具有bar递归变体的简单类型的全语言来进行比较。这种翻译依赖于二阶算术的可实现性解释。由于哥德尔的不完备性定理,在二阶算术中没有证明系统F的终止性。然而,对于系统F的每一个单独的项,在二阶算术中有一个证明,它终止了,其可实现性解释提供了一个减少步骤的数量上的界限,以达到范式。利用这个界,我们通过原始递归计算范式。此外,由于系统F的规范化证明是通过类型化推导的归纳进行的,因此翻译是组合的。我们的方法的灵活性打开了获得更直接的翻译,将提供一种替代方法来研究多态性,即通过酒吧递归的可能性。

英文摘要:

There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a fundamentally different computational behavior and their relationship is not well understood. We make a step towards a comparison by defining the first translation of system F into a simply-typed total language with a variant of bar recursion. This translation relies on a realizability interpretation of second-order arithmetic. Due to Gödel's incompleteness theorem there is no proof of termination of system F within second-order arithmetic. However, for each individual term of system F there is a proof in second-order arithmetic that it terminates, with its realizability interpretation providing a bound on the number of reduction steps to reach a normal form. Using this bound, we compute the normal form through primitive recursion. Moreover, since the normalization proof of system F proceeds by induction on typing derivations, the translation is compositional. The flexibility of our method opens the possibility of getting a more direct translation that will provide an alternative approach to the study of polymorphism, namely through bar recursion.

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

↑