A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
The Strength of Non-size-increasing Computation (Introduction and Summary)
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
An arithmetic for non-size-increasing polynomial-time computation
Theoretical Computer Science - Implicit computational complexity
A Type Driven Theory of Predication with Complex Types
Fundamenta Informaticae - Logic for Pragmatics
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Identifying polynomial-time recursive functions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A Type Driven Theory of Predication with Complex Types
Fundamenta Informaticae - Logic for Pragmatics
| Hi-index | 0.00 |
A purely syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof also gives explicit polynomial bounds that can easily be calculated.