Church => Scott = Ptime: an application of resource sensitive realizability

Details Church => Scott = Ptime: an application of resource sensitive realizability Church => Scott = Ptime: an application of resource sensitive realizability

2010-05-04

arxiv.org/abs/1005.0524v1

EPTCS 23, 2010, pp. 31-46

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.23.3

We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott encodings (purely linear representations of words) are by a linear type `Scott.' We give a characterization of polynomial time functions, which is derived from (Leivant and Marion 93): a function is computable in polynomial time if and only if it can be represented by a term of type Church => Scott. To prove soundness, we employ a resource sensitive realizability technique developed by Hofmann and Dal Lago.

Affiliated with

Also associated with

No associations

Rating

Church => Scott = Ptime: an application of resource sensitive realizability 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 Church => Scott = Ptime: an application of resource sensitive realizability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Church => Scott = Ptime: an application of resource sensitive realizability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532231