Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
A type system for lock-free processes
Information and Computation - IFIP TCS2000
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Another Type System for In-Place Update
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
The Strength of Non-size-increasing Computation (Introduction and Summary)
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
On Lexicographic Termination Ordering with Space Bound Certifications
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A type system for bounded space and functional in-place update
Nordic Journal of Computing
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Theories with self-application and computational complexity
Information and Computation
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Semantics of linear/modal lambda calculus
Journal of Functional Programming
Heap-Bounded Assembly Language
Journal of Automated Reasoning
Representing reductions of NP-complete problems in logical frameworks: a case study
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
An arithmetic for non-size-increasing polynomial-time computation
Theoretical Computer Science - Implicit computational complexity
Stratified coherence spaces: a denotational semantics for light linear logic
Theoretical Computer Science - Implicit computational complexity
On an interpretation of safe recursion in light affine logic
Theoretical Computer Science - Implicit computational complexity
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
An arithmetic for polynomial-time computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
The Power of Closed Reduction Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Taming Modal Impredicativity: Superlazy Reduction
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Typing with conditions and guarantees for functional in-place update
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
A semantic proof of polytime soundness of light affine logic
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Quasi-interpretations a way to control resources
Theoretical Computer Science
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Calculating polynomial runtime properties
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Towards an implicit characterization of NCk
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
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Linear dependent types in a call-by-value scenario
Proceedings of the 14th symposium on Principles and practice of declarative programming
Ten years of amortized resource analysis
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Higher-order functional reactive programming without spacetime leaks
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| 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.