An Implicit Characterization of PSPACE

Details An Implicit Characterization of PSPACE An Implicit Characterization of PSPACE

2010-05-31

arxiv.org/abs/1006.0030v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Implicit Characterization of PSPACE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Implicit Characterization of PSPACE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Implicit Characterization of PSPACE will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92859