Polynomial Time and Dependent Types

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 const...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 8; no. POPL; pp. 2288 - 2317
Main Author:	Atkey, Robert
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 02.01.2024
Subjects:	Categorical semantics Complexity classes Complexity theory and logic Linear logic Theory of computation Type theory linear logic type theory implicit computational complexity
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!