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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 8; H. POPL; S. 2288 - 2317
1. Verfasser:	Atkey, Robert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 02.01.2024
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!