Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Information and Computation
(Optimal) duplication is not elementary recursive
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Checking Polynomial Time Complexity with Types
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Light Types for Polynomial Time Computation in Lambda-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Principal typing in elementary affine logic
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Light types for polynomial time computation in lambda calculus
Information and Computation
Type Inference for a Polynomial Lambda Calculus
Types for Proofs and Programs
Quantum implicit computational complexity
Theoretical Computer Science
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Type inference in intuitionistic linear logic
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Light logics and optimal reduction: Completeness and complexity
Information and Computation
An elementary affine λ-calculus with multithreading and side effects
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Verification of ptime reducibility for system f terms via dual light affine logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.