4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Characterizing complexity classes by higher type primitive recursive definitions
Theoretical Computer Science
Information and Computation
Journal of the ACM (JACM)
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Predicative Functional Recurrence and Poly-space
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Implicit Characterizations of Pspace
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Linear Types and Non Size-Increasing Polynomial Time Computation
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Light Types for Polynomial Time Computation in Lambda-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stratified Bounded Affine Logic for Logarithmic Space
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A call-by-name lambda-calculus machine
Higher-Order and Symbolic Computation
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)
Light types for polynomial time computation in lambda calculus
Information and Computation
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
The complexity of β-reduction in low orders
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Space-Efficient computation by interaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Elementary affine logic and the call-by-value lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A polytime functional language from light linear logic
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
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 |
We present a type system for an extension of lambda calculus with a conditional construction, named STAB, that characterizes the PSPACE class. This system is obtained by extending STA, a type assignment for lambda-calculus inspired by Lafont’s Soft Linear Logic and characterizing the PTIME class. We extend STA by means of a ground type and terms for Booleans and conditional. The key issue in the design of the type system is to manage the contexts in the rule for conditional in an additive way. Thanks to this rule, we are able to program polynomial time Alternating Turing Machines. From the well-known result APTIME = PSPACE, it follows that STAB is complete for PSPACE. Conversely, inspired by the simulation of Alternating Turing machines by means of Deterministic Turing machine, we introduce a call-by-name evaluation machine with two memory devices in order to evaluate programs in polynomial space. As far as we know, this is the first characterization of PSPACE that is based on lambda calculus and light logics.