Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Theoretical Computer Science
BCK-combinators and linear &lgr;-terms have types
Theoretical Computer Science
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Outline of a Proof Theory of Parametricity
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
The circuit value problem is log space complete for P
ACM SIGACT News
Journal of Functional Programming
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Deciding kCFA is complete for EXPTIME
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Flow Analysis, Linearity, and PTIME
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Linear lambda calculus and deep inference
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
| Hi-index | 0.00 |
We give transparent proofs of the PTIME-completeness of two decision problems for terms in the λ-calculus. The first is a reproof of the theorem that type inference for the simply-typed λ-calculus is PTIME-complete. Our proof is interesting because it uses no more than the standard combinators Church knew of some 70 years ago, in which the terms are linear affine – each bound variable occurs at most once. We then derive a modification of Church's coding of Booleans that is linear, where each bound variable occurs exactly once. A consequence of this construction is that any interpreter for linear λ-calculus requires polynomial time. The logical interpretation of this consequence is that the problem of normalizing proofnets for multiplicative linear logic (MLL) is also PTIME-complete.