27 research outputs found
A tier-based typed programming language characterizing Feasible Functionals
Get PDFInternational audienceThe class of Basic Feasible Functionals BFF 2 is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF 2 based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the size of the program) of the type inference algorithm contrasts with the intractability of the aforementioned methods and does not restrain strongly the expressive power of the language
Michael Arbib and Manuel Blum. Machine dependence of degree of difficulty. Proceedings of the American Mathematical Society, vol. 16 (1965), pp. 442–447.
Full text linkEttore Carruccio. Sulle dimostrazioni di coerenza dei sistemi ipotetico-deduttivi. Università e Politecnico di Torino, Rendiconti del Seminario Matematico, vol. 10 (1950–1951), pp. 97–110.
Full text linkB. M. Kloss. K oprédéléniú složnosti algoritmov. Doklady Akademii Nauk SSSR, vol. 157 (1964), pp. 38–40. - B. M. Kloss. The definition of complexity of algorithms. English translation of the preceding by S. L. Bloom. Soviet Mathematics, vol. 5 no. 4 (1964), pp. 880–882.
Full text link
