Taming Modal Impredicativity: Superlazy Reduction

Details Taming Modal Impredicativity: Superlazy Reduction Taming Modal Impredicativity: Superlazy Reduction

2008-10-16

arxiv.org/abs/0810.2891v2

Computer Science

Logic in Computer Science

Scientific paper

Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativity causing the complexity of cut-elimination to be problematic from a complexity point of view. Modal impredicativity occurs when, during reduction, the conclusion of a residual of a box b interacts with a node that belongs to the proof net inside another residual of b. Technically speaking, superlazy reduction is a new notion of reduction that allows to control modal impredicativity. More specifically, superlazy reduction replicates a box only when all its copies are opened. This makes the overall cost of reducing a proof net finite and predictable. Specifically, superlazy reduction applied to any pure proof nets takes primitive recursive time. Moreover, any primitive recursive function can be computed by a pure proof net via superlazy reduction.

Affiliated with

Also associated with

No associations

Rating

Taming Modal Impredicativity: Superlazy Reduction 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 Taming Modal Impredicativity: Superlazy Reduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Taming Modal Impredicativity: Superlazy Reduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-368000