Theoretical Computer Science
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Calibrating Computational Feasibility by Abstraction Rank
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
(Optimal) duplication is not elementary recursive
Information and Computation
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Light types for polynomial time computation in lambda calculus
Information and Computation
Multivariate amortized resource analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quasi-interpretations a way to control resources
Theoretical Computer Science
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Type-Based amortised heap-space analysis
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
A soft type assignment system for &lambda-calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say computable in time bounded by a tower of exponentials of fixed height. Our goal here is to show that despite its simplicity, elementary linear logic can nevertheless be used as a common framework to characterize the different levels of a hierarchy of deterministic time complexity classes, within elementary time. We consider a variant of this logic with type fixpoints and weakening. By selecting specific types we then characterize the class P of polynomial time predicates and more generally the hierarchy of classes k-EXP, for k≥0, where k-EXP is the union of DTIME $(2_k^{n^i})$ , for i≥1.