Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A query language for list-based complex objects
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Functional database query languages as typed lambda calculi of fixed order (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
General Recursion on Second Order Term Algebras
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Implicit Computational Complexity for Higher Type Functionals
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Semantics of linear/modal lambda calculus
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
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implicit complexity over an arbitrary structure: quantifier alternations
Information and Computation
On light logics, uniform encodings and polynomial time
Mathematical Structures in Computer Science
ACM Transactions on Computational Logic (TOCL)
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Types for Proofs and Programs
Linear logic by levels and bounded time complexity
Theoretical Computer Science
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
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
Predicative analysis of feasibility and diagonalization
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
A characterization of alternating log time by first order functional programs
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Towards an implicit characterization of NCk
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |