Time-Complexity Semantics for Feasible Affine Recursions
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.
KeywordsBase Type Recursive Call Typing Rule Elimination Rule Type Context
Unable to display preview. Download preview PDF.
- 2.Barber, A.: Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, (1996) http://www.lfcs.inf.ed.ac.uk/reports/96/ECS-LFCS-96-347/index.html
- 4.Cook, S., Urquhart, A.: Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic 63(2), 103–200 (1993), URL: http://dx.doi.org/10.1016/0168-00729390044-E
- 5.Danner, N., Royer, J.S.: Adventures in time and space. In: Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, 2006. Association for Computing Machinery, pp. 168–179. ACM Press, New York (2006), http://doi.acm.org/10.1145/1111037.1111053 CrossRefGoogle Scholar
- 6.Danner, N., Royer, J.S.: Adventures in time and space. To appear in Logical Methods in Computer Science; full version, at http://arxiv.org/abs/cs/0612116
- 7.Frederiksen, C.C., Jones, N.D.: Recognition of polynomial-time programs. Technical Report TOPPS/D-501, DIKU, University of Copenhagen (2004), http://www.diku.dk/topps/bibliography/2004.html
- 11.Leivant, D.: Ramified recurrence and computational complexity I: Word recurrence and poly-time. In: Feasible Mathematics II (Ithaca, NY, 1992), pp. 320–343. Birkhäuser Boston, Boston, MA (1995)Google Scholar