Theoretical Computer Science
Proofs and types
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Information and Computation
Information and Computation
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Phase semantics and decidability of elementary affine logic
Theoretical Computer Science - Logic, semantics and theory of programming
Linear and affine logics with temporal, spatial and epistemic operators
Theoretical Computer Science
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Linear logic and polynomial time
Mathematical Structures in Computer Science
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
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
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
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
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)
Type Inference for a Polynomial Lambda Calculus
Types for Proofs and Programs
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Quantum implicit computational complexity
Theoretical Computer Science
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
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
A logical calculus for modelling interferences
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
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
Realizability models and implicit complexity
Theoretical Computer Science
Complexity of strongly normalising λ-terms via non-idempotent intersection types
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
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
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
The elimination of nesting in SPCF
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
Linear logical relations for session-based concurrency
ESOP'12 Proceedings of the 21st European 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
Typing a core binary-field arithmetic in a light logic
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
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
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
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Type-Based complexity analysis for fork processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We present a subsystem of second-order linear logic with restricted rules for exponentials so that proofs correspond to polynomial time algorithms, and vice versa.