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

Church => Scott = Ptime:资源敏感可实现性的一个应用

Church => Scott = Ptime: an application of resource sensitive realizability

Aloïs Brunel, Kazushige Terui

摘要:

我们介绍了一个变种的线性逻辑与二阶量词和类型不动点,都限制在纯线性公式。二进制单词的Church编码是由标准的非线性类型“Church”类型,而Scott编码(单词的纯线性表示)是由线性类型“Scott”类型。“我们给出了多项式时间函数的一个特征,它是从(Leivant和Marion 93)推导出来的:一个函数在多项式时间内是可计算的,当且仅当它可以用Church => Scott类型的项表示。为了证明合理性,我们采用了资源敏感的可实现性技术开发的霍夫曼和达拉戈。

英文摘要:

We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott encodings (purely linear representations of words) are by a linear type `Scott.' We give a characterization of polynomial time functions, which is derived from (Leivant and Marion 93): a function is computable in polynomial time if and only if it can be represented by a term of type Church => Scott. To prove soundness, we employ a resource sensitive realizability technique developed by Hofmann and Dal Lago.

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

↑