Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Region-based memory management
Information and Computation
Information and Computation
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static prediction of heap space usage for first-order functional programs
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Realizability models for BLL-like languages
Theoretical Computer Science - Implicit computational complexity
Automated and certified conformance to responsiveness policies
TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
Time-Complexity Semantics for Feasible Affine Recursions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Light types for polynomial time computation in lambda calculus
Information and Computation
A flow calculus of mwp-bounds for complexity analysis
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
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 Categorical Setting for Lower Complexity
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability models and implicit complexity
Theoretical Computer Science
Proceedings of the 4th International Workshop on Logic in Databases
Higher-order functional reactive programming in bounded space
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Space-Efficient computation by interaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Mobile resource guarantees for smart devices
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Identifying polynomial-time recursive functions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
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
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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
Safe recursion revisited I: Categorical semantics for lower complexity
Theoretical Computer Science
| Hi-index | 0.00 |
We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are polynomial time computable. The system improves upon previous such systems in that recursive definitions can be arbitrarily nested; in particular, no predicativity or modality restrictions are made.