An arithmetic for non-size-increasing polynomial-time computation
نویسندگان
چکیده
منابع مشابه
An arithmetic for non-size-increasing polynomial-time computation
An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel’s and therefore defines a non-size-increasing polynomial time computable function.
متن کاملLinear Types and Non-Size-Increasing Polynomial Time Computation
We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are polynomial time computable. The system improves upon previous such systems in that recursive definitions can be arbitrarily nested; in particular, no predicativity or modality restrictions are made. 2003 Elsevier Science (USA). All rights reserved.
متن کاملAn arithmetic for polynomial-time computation
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs are feasible. The restrictions consist in linearity and ramification requirements.
متن کاملThe Strength of Non-size-increasing Computation (Introduction and Summary)
We study the expressive power non-size increasing recursive definitions over lists. This notion of computation is such that the size of all intermediate results will automatically be bounded by the size of the input so that the interpretation in a finite model is sound with respect to the standard semantics. Many well-known algorithms with this property such as the usual sorting algorithms are ...
متن کاملType Systems for Polynomial-time Computation
This thesis introduces and studies a typed lambda calculus with higher-order primitive recursion over inductive datatypes which have the property that all de nable number-theoretic functions are polynomial time computable. This is achieved by imposing type-theoretic restrictions on the way results of recursive calls can be used. The main technical result is the proof of the characteristic prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.10.023