A new recursion-theoretic characterization of the polytime functions (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theories with self-application and computational complexity
Information and Computation
A predicative approach to the classification problem
Journal of Functional Programming
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
A proof-theoretic characterization of the basic feasible functionals
Theoretical Computer Science
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A decidable characterization of the classes between lintime and exptime
Information Processing Letters
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Linear logic by levels and bounded time complexity
Theoretical Computer Science
A decidable characterization of the classes between lintime and exptime
Information Processing Letters
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
Predicative analysis of feasibility and diagonalization
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Feasible functions over co-inductive data
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
| Hi-index | 0.00 |