Descriptive characterizations of computational complexity
Journal of Computer and System Sciences
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
Journal of the ACM (JACM)
Optimizing object queries using an effective calculus
ACM Transactions on Database Systems (TODS)
The strength of non-size increasing computation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Strength of Non-size-increasing Computation (Introduction and Summary)
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Linear Ramified Higher Type Recursion and Parallel Complexity
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
A predicative approach to the classification problem
Journal of Functional Programming
Realizability models for BLL-like languages
Theoretical Computer Science - Implicit computational complexity
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
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
Bounded Linear Logic, Revisited
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A Categorical Setting for Lower Complexity
Electronic Notes in Theoretical Computer Science (ENTCS)
Structural recursion on ordered trees and list-based complex objects
ICDT'07 Proceedings of the 11th international conference on Database Theory
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
A higher-order characterization of probabilistic polynomial time
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 |