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
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
(Optimal) duplication is not elementary recursive
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive
Information and Computation
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Scalable Certification for Typed Assembly Language
TIC '00 Selected papers from the Third International Workshop on Types in Compilation
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
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
Information and Computation
(Optimal) duplication is not elementary recursive
Information and Computation
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
ACM Transactions on Computational Logic (TOCL)
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Typing lambda terms in elementary logic with linear constraints
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
The complexity of β-reduction in low orders
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Complexity of higher-order queries
Proceedings of the 14th International Conference on Database Theory
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
Model Checking Higher-Order Programs
Journal of the ACM (JACM)
Hi-index | 5.23 |