Theoretical Computer Science
Additives of linear logic and normalization: part I: A (restricted) Church--Rosser property
Theoretical Computer Science - Linear logic
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Obsessional experiments for linear logic proof-nets
Mathematical Structures in Computer Science
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
Phase semantics and decidability of elementary affine logic
Theoretical Computer Science - Logic, semantics and theory of programming
An elementary fragment of second-order lambda calculus
ACM Transactions on Computational Logic (TOCL)
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Linear logic and polynomial time
Mathematical Structures in Computer Science
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Principal typing in elementary affine logic
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Controlling program extraction in light logics
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
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
A feasible algorithm for typing in elementary affine logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A polynomial time λ-calculus with multithreading and side effects
Proceedings of the 14th symposium on Principles and practice of declarative programming
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions. Its choicest part consists in reducing the deductive power of the exponential, also known as the "bang," which, in linear logic, is in charge of controlling duplication in the cut-elimination process.