ABSTRACT
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.
- Serge Abiteboul and Victor Vianu. Fixpoint extensions of first-order logic and datalog-like languages. In Proceedings of the 4th Annual Symposium on Logic in Computer Science -- LICS'89, pages 71--79, Asilomar, California, 1989. IEEE Computer Society Press. Google Scholar
Digital Library
- Andrea Asperti and Luca Roversi. Intuitionistic light affine logic. ACM Transactions on Computational Logic, 3(1):137--175, 2002. Google Scholar
Digital Library
- Patrick Baillot and Kazushige Terui. Light types for polynomial time computation in lambda-calculus. In Proceedings of the 19th Annual Symposium on Logic in Computer Science -- LICS'04, pages 266--275, Turku, Finland, 2004. IEEE Computer Society Press. Google Scholar
Digital Library
- Henk Barendregt. The Lambda Calculus: Its Syntax and Semantics. Elsevier/North-Holland, Amsterdam, London, New York, revised edition, 1984.Google Scholar
- Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114--133, 1981. Google Scholar
Digital Library
- Paolo Coppola, Ugo Dal Lago, and Simona Ronchi Della Rocca. Elementary affine logic and the call by value lambda calculus. In Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference -- TLCA '05, Nara, Japan, April 21-23, 2005, volume 3461 of Lecture Notes in Computer Science, pages 131--145. Springer, 2005. Google Scholar
Digital Library
- Marco Gaboardi and Simona Ronchi Della Rocca. A soft type assignment system for λ-calculus. In Proceedings of the Computer Science Logic, 21st International Workshop -- CSL'07, Lausanne, Switzerland, September 11-15, 2007, volume 4646 of Lecture Notes in Computer Science, pages 253--267. Springer, 2007. Google Scholar
Digital Library
- Jean-Yves Girard. Light linear logic. Information and Computation, 143(2): 175--204, 1998. Google Scholar
Digital Library
- Andreas Goerdt. Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science, 100(1):45--66, 1992. Google Scholar
Digital Library
- Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, and Scott Weinstein. Finite Model Theory and its applications. Springer, 2007.Google Scholar
Digital Library
- Neil D. Jones. The expressive power of higher-order types or, life without cons. Journal of Functional Programming, 11(1):55--94, 2001. Google Scholar
Digital Library
- Jean-Louis Krivine. A call-by-name lambda calculus machine. Higher Order and Symbolic Computation, 2007. To appear. Google Scholar
Digital Library
- Yves Lafont. Soft linear logic and polynomial time. Theoretical Computer Science, 318(1-2):163--180, 2004. Google Scholar
Digital Library
- Daniel Leivant and Jean-Yves Marion. Lambda calculus characterizations of poly-time. In Proceedings of the Typed Lambda Calculi and Applications, 1tst International Conference -- TLCA '93, Utrecht, The Netherlands, March 16-18, 1993, volume 664 of Lecture Notes in Computer Science, pages 274--288. Springer, 1993. Google Scholar
Digital Library
- Daniel Leivant and Jean-Yves Marion. Ramified recurrence and computational complexity II: Substitution and poly-space. In Proceedings of the Computer Science Logic, 8th International Workshop -- CSL'94, Kazimierz, Poland September 25-30, 1994, volume 933 of Lecture Notes in Computer Science, pages 486--500. Springer, 1994. Google Scholar
Digital Library
- Daniel Leivant and Jean-Yves Marion. Predicative functional recurrence and poly-space. In Proceedings of the Theory and Practice of Software Development, 7th International Joint Conference -- TAPSOFT'97, volume 1214 of Lecture Notes in Computer Science, pages 369--380. Springer-Verlag, 1997. Google Scholar
Digital Library
- François Maurel. Nondeterministic light logics and NP-time. In Martin Hofmann, editor, Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference -- TLCA 2003, Valencia, Spain, June 10-12, 2003, volume 2701 of Lecture Notes in Computer Science, pages 241--255. Springer, 2003. Google Scholar
Digital Library
- Virgile Mogbil and Vincent Rahli. Uniform circuits, & boolean proof nets. In Sergei N. Artemov and Anil Nerode, editors, Proceedings of the Symposium on Logical Foundations of Computer Science -- LFCS'07, volume 4514 of Lecture Notes in Computer Science, pages 401--421. Springer, June 2007. Google Scholar
Digital Library
- Isabel Oitavem. Implicit characterizations of pspace. In Proceedings of the Proof Theory in Computer Science, International Seminar -- PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, volume 2183 of Lecture Notes in Computer Science, pages 170--190. Springer, 2001. Google Scholar
Digital Library
- Simona Ronchi Della Rocca and Luca Roversi. Lambda calculus and intuitionistic linear logic. Studia Logica, 59(3), 1997.Google Scholar
- Walter J. Savitch. Relationship between nondeterministic and deterministic tape classes. Journal of Computer and System Sciences, 4:177--192, 1970.Google Scholar
Digital Library
- Ulrich Schöpp. Stratified bounded affine logic for logarithmic space. In Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science -- LICS '07, pages 411--420, Wroclaw, Poland, 2007. IEEE Computer Society. Google Scholar
Digital Library
- Kazushige Terui. Linear logical characterization of polyspace functions (extended abstract), 2000. URL http://citeseer.ist.psu.edu/294754.html. Unpublished.Google Scholar
- Kazushige Terui. Proof nets and boolean circuits. In Proceedings of the 19th Annual Symposium on Logic in Computer Science -- LICS'04, pages 266--275, Turku, Finland, 2004. IEEE Computer Society Press. Google Scholar
Digital Library
- Moshe Y. Vardi. Complexity and relational query languages. In Fourteenth Symposium on Theory of Computing, pages 137--146. ACM, New York, 1982. Google Scholar
Digital Library
Index Terms
A logical account of pspace
Recommendations
A logical account of pspace
POPL '08We 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 ...
An Implicit Characterization of PSPACE
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 ...
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and complete for polynomial time computations. SLL is the basis for the design of ...







Comments