Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Term rewriting and all that
Information and Computation
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Algorithms with polynomial interpretation termination proof
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
Lambda-Calculus and Combinators: An Introduction
Lambda-Calculus and Combinators: An Introduction
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Quasi-interpretations a way to control resources
Theoretical Computer Science
| Hi-index | 0.00 |
These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have been obtained by enriching and polishing a set of notes the author wrote for a course (on the same subject) he gave at ESSLLI 2010. These notes are definitely not meant to be comprehensive nor exhaustive, but on the other hand much effort has been done to keep them self-contained.