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

二阶多项式时间的完全且易处理的机器无关刻画

Complete and tractable machine-independent characterizations of second-order polytime

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux

AI总结:

本文提出了BFF的首个易处理、可靠、完全且隐式的刻画,通过基于项的类型化编程语言和非递归命令式过程,解决了悬置超过20年的开放问题。

摘要:

Basic Feasible Functionals (BFF) 类是多项式时间可计算的一阶函数类的二阶对应物。我们提出了基于项的类型化编程语言的 BFF 的若干隐式刻画。这些项可以调用非递归的命令式过程。类型约束分为两层:项遵循标准的简单类型约束,过程遵循标准的基于层级的类型约束。BFF 恰好由可类型化且终止的程序所计算的二阶泛函组成。令人惊讶的是,即使没有 lambda 抽象,这种刻画的完全性依然成立。此外,终止性要求可以被指定为一个保持完全性的实例,该实例可以在与程序大小呈二次关系的时间内被判定。由于类型判定可在多项式时间内完成,我们获得了 BFF 的首个易处理(即在多项式时间内可判定)、可靠、完全且隐式的刻画,从而解决了一个悬置超过 20 年的开放问题。

英文摘要:

The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of terms. These terms may perform calls to non-recursive imperative procedures. The type discipline has two layers: the terms follow a standard simply-typed discipline and the procedures follow a standard tier-based type discipline. BFF consists exactly of the second-order functionals that are computed by typable and terminating programs. The completeness of this characterization surprisingly still holds in the absence of lambda-abstraction. Moreover, the termination requirement can be specified as a completeness-preserving instance, which can be decided in time quadratic in the size of the program. As typing is decidable in polynomial time, we obtain the first tractable (i.e., decidable in polynomial time), sound, complete, and implicit characterization of BFF, thus solving a problem opened for more than 20 years.

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

↑