Time-complexity semantics for feasible affine recursions (extended abstract)
| dc.creator | Danner, Norman | |
| dc.creator | Royer, James S. | |
| dc.date | 2007-01-11 | |
| dc.date | 2007-03-20 | |
| dc.date.accessioned | 2026-07-07T07:52:28Z | |
| dc.date.available | 2026-07-07T07:52:28Z | |
| dc.description | The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2). A limitation of the original version of ATR is that the only directly expressible recursions are tail-recursions. Here we extend ATR so that a broad range of affine recursions are directly expressible. In particular, the revised ATR can fairly naturally express the classic insertion- and selection-sort algorithms, thus overcoming a sticking point of most prior implicit-complexity-based formalisms. The paper's main work is in extending and simplifying the original time-complexity semantics for ATR to develop a set of tools for extracting and solving the higher-type recurrences arising from feasible affine recursions. | |
| dc.description | Typographical fixes; some rearrangement of material. A shortened version is to appear in S.B. Cooper, B. Lowe, A. Sorbi (eds.),_Computation in the Real World_ (Proceedings Computation in Europe 2007, Sienna), Springer-Verlag, Berlin, 2007 | |
| dc.identifier | https://arxiv.org/abs/cs/0701076 | |
| dc.identifier | http://arxiv.org/abs/cs/0701076 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/125890 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.3; F.1.3 | |
| dc.title | Time-complexity semantics for feasible affine recursions (extended abstract) | |
| dc.type | text |