A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Information and Computation
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Program Extraction from Normalization Proofs
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Intrinsic Theories and Computational Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
An arithmetic for non-size-increasing polynomial-time computation
Theoretical Computer Science - Implicit computational complexity
A complexity analysis of functional interpretations
Theoretical Computer Science
Quantum implicit computational complexity
Theoretical Computer Science
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Introduction to clarithmetic I
Information and Computation
| Hi-index | 0.00 |
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.