A simple proof of a theorem of Statman
Theoretical Computer Science
The undecidability of the semi-unification problem
Information and Computation
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Information and Computation
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Characterizing Complexity Classes by General Recursive Definitions in Higher Types
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Complexity of the higher order matching
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Type Inference for a Polynomial Lambda Calculus
Types for Proofs and Programs
The complexity of β-reduction in low orders
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A soft type assignment system for &lambda-calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
Soft type assignment systems STA, STA+, and STAB characterise by means of reduction of terms the computation in complexity classes PTIME, NP, and PSPACE, respectively. All these systems are inspired by linear logic and include polymorphism similar to the one of System F. We show that the presence of polymorphism gives undecidability of typechecking and type inference. We also show that reductions in decidable monomorphic versions of these systems also capture the same complexity classes in a way sufficient for the traditional complexity theory. The reductions we propose show in addition that the monomorphic systems to serve as a programming language require some metalanguage support since the program which operates on data has form and type which depend on the size of the input.