Isolating Resource Consumption in Linear Logic Proof Search

This work presents an extension of the Tag-Frame resource management system previously developed by the authors. The extended proof system is able to isolate the consumption of a given goal/clause without incurring significant extra runtime costs. We believe this feature may have a number of applications, in particular for debugging linear logic programs and specifications in a proof-theoretic setting. This point is illustrated by means of a simple example.