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
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
Proof Nets and Boolean Circuits
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Light Types for Polynomial Time Computation in Lambda-Calculus
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
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
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
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 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
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Calculi, types and applications
Theoretical Computer Science
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Linear logic by levels and bounded time complexity
Theoretical Computer Science
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
Collected size semantics for functional programs over lists
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
Elementary linear logic revisited for polynomial time and an exponential time hierarchy
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Type-Based complexity analysis for fork processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We propose a characterization of PSPACE by means of atype assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension of STA, a type assignment for lambda-calculus inspired by Lafont's Soft Linear Logic. We extend STA by means of a ground type and terms for booleans. The key point is that the elimination rule for booleans is managed in an additive way. Thus, we are able to program polynomial time Alternating Turing Machines. Conversely, we introduce a call-by-name evaluation machine in order tocompute programs in polynomial space. As far as we know, this is the first characterization of PSPACE which is based on lambda calculusand light logics.