A syntactical analysis of non-size-increasing polynomial time computation
A syntactical proof is given that all functions definable in a certain affine linear typed λ-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be calculated.
Gespeichert in:
| Veröffentlicht in: | ACM transactions on computational logic 2002-07, Vol.3 (3), p.383-401 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A syntactical proof is given that all functions definable in a certain affine linear typed λ-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be calculated. |
|---|---|
| ISSN: | 1529-3785 1557-945X |
| DOI: | 10.1145/507382.507386 |