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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 8; číslo POPL; s. 2288 - 2317
Hlavný autor:	Atkey, Robert
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 02.01.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!