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

内涵性、内涵递归和哥德尔-洛布公理

Intensionality, Intensional Recursion, and the Gödel-Löb axiom

G. A. Kavvos

摘要:

在类型化的$λ$演算中使用必要性模态可以将其分成两个区域。这些可以被认为是内涵与外延数据:第一个区域中的数据,模态数据,可以作为代码使用,并且可以检查它们的描述。相比之下,第二区域中的数据仅可用作达到普通相等的值。这允许我们在模态类型上添加非函数操作,同时保持一致性。在这种情况下,哥德尔-洛布公理获得了一种新颖的建设性解读:它为程序员提供了一种非常强的递归的可能性,使他们能够编写能够访问自己代码的程序。这是一种计算反射,强烈地让人想起Kleene的第二递归定理。

英文摘要:

The use of a necessity modality in a typed $λ$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and their description can be examined. In contrast, data in the second region are only available as values up to ordinary equality. This allows us to add non-functional operations at modal types whilst maintaining consistency. In this setting, the Gödel-Löb axiom acquires a novel constructive reading: it affords the programmer the possibility of a very strong kind of recursion which enables them to write programs that have access to their own code. This is a type of computational reflection that is strongly reminiscent of Kleene's Second Recursion Theorem.

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

↑