(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
Additives of linear logic and normalization: part I: A (restricted) Church--Rosser property
Theoretical Computer Science - Linear logic
Phase semantics for light linear logic
Theoretical Computer Science - Linear logic
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Obsessional experiments for linear logic proof-nets
Mathematical Structures in Computer Science
Sequentiality vs. concurrency in games and logic
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
Realizability models for BLL-like languages
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
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)
An arithmetic for polynomial-time computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Linear logic and polynomial time
Mathematical Structures in Computer Science
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Multiplexor Categories and Models of Soft Linear Logic
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Light types for polynomial time computation in lambda calculus
Information and Computation
Taming Modal Impredicativity: Superlazy Reduction
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Light Linear Logic with Controlled Weakening
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Types for Proofs and Programs
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
On Constructor Rewrite Systems and the Lambda-Calculus
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Quantum implicit computational complexity
Theoretical Computer Science
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Sharing Implementations of Graph Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
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
Principal typing in elementary affine logic
TLCA'03 Proceedings of the 6th 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
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A characterization of NCk by first order functional programs
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A semantic proof of polytime soundness of light affine logic
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A local criterion for polynomial-time stratified computations
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Light logics and optimal reduction: Completeness and complexity
Information and Computation
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Realizability models and implicit complexity
Theoretical Computer Science
Theoretical Computer Science
Estimation of the length of interactions in arena game semantics
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
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
Introduction to clarithmetic I
Information and Computation
The role of polymorphism in the characterisation of complexity by soft types
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
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
Quantitative models and implicit complexity
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
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
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
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
Elementary Complexity and Geometry of Interaction
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
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
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |