(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)
A P-Time Completeness Proof for Light Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Discreet Games, Light Affine Logic and PTIME Computation
Proceedings of the 14th 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
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Semantics of linear/modal lambda calculus
Journal of Functional Programming
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
On an interpretation of safe recursion in light affine logic
Theoretical Computer Science - Implicit computational complexity
Phase semantics and decidability of elementary affine logic
Theoretical Computer Science - Logic, semantics and theory of programming
(Optimal) duplication is not elementary recursive
Information and Computation
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Light types for polynomial time computation in lambda calculus
Information and Computation
Light Linear Logic with Controlled Weakening
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Type Inference for a Polynomial Lambda Calculus
Types for Proofs and Programs
Quantum implicit computational complexity
Theoretical Computer Science
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Evolving games and essential nets for affine polymorphism
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
From proof-nets to linear logic type systems for polynomial time computing
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Light logics and optimal reduction: Completeness and complexity
Information and Computation
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 affine logic and the call-by-value lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
The elimination of nesting in SPCF
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
A polynomial time λ-calculus with multithreading and side effects
Proceedings of the 14th symposium on Principles and practice of declarative programming
Rewriting Computation and Proof
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 |