arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.09145cs.LOcs.PL
收藏

多项式时间与依赖类型

Polynomial Time and Dependent Types

Robert Atkey

AI总结:

本文结合依赖类型与线性类型系统,通过两种方法(禁止可迭代数据构造和基于LFPL的支付方法)捕获多项式时间计算,并证明其可靠性,旨在统一外延与内部推理。

摘要:

我们将依赖类型与能够可靠且完整地捕获多项式时间计算的线性类型系统相结合。我们探索了两种捕获多项式时间的系统:一种禁止构造可迭代数据,另一种基于Martin Hofmann的LFPL系统,通过支付方法控制构造。这两种系统都通过定量类型理论扩展到完整的依赖类型,允许在类型中进行任意计算,同时保证项中的多项式时间计算。我们使用Dal Lago和Hofmann的可实现性技术证明了系统的可靠性。我们的长期目标是将类型理论的外延推理与程序内在消耗资源的内部推理相结合。本文是沿着这条路径迈出的一步,我们希望这将导致用于推理程序资源使用的实用系统,以及作为合成计算复杂性理论形式的理论用途。

英文摘要:

We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one, based on the LFPL system of Martin Hofmann, that controls construction via a payment method. Both of these are extended to full dependent types via Quantitative Type Theory, allowing for arbitrary computation in types alongside guaranteed polynomial time computation in terms. We prove the soundness of the systems using a realisability technique due to Dal Lago and Hofmann. Our long-term goal is to combine the extensional reasoning of type theory with intensional reasoning about the resources intrinsically consumed by programs. This paper is a step along this path, which we hope will lead both to practical systems for reasoning about programs' resource usage, and to theoretical use as a form of synthetic computational complexity theory.

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

↑