An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Term rewriting and all that
Call-by-name call-by-value, call-by-need and the linear lambda calculus
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sound type system for secure flow analysis
Journal of Computer Security
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Parallel beta reduction is not elementary recursive
Information and Computation
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Dependent Types for Program Termination Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Type-Based Termination with Sized Products
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Light types for polynomial time computation in lambda calculus
Information and Computation
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Static determination of quantitative resource usage for higher-order programs
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Multivariate amortized resource analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear Dependent Types and Relative Completeness
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Linear dependent types [11] allow to precisely capture both the extensional behavior and the time complexity of λ-terms, when the latter are evaluated by Krivine's abstract machine. In this work, we show that the same paradigm can be applied to call-by-value computation. A system of linear dependent types for Plotkin's PCF is introduced, called dlPCFv whose types reflect the complexity of evaluating terms in the so-called CEK machine. dlPCFv is proved to be sound, but also relatively complete: every true statement about the extensional and intentional behavior of terms can be derived, provided all true index term inequalities can be used as assumptions.