Construction of retractile proof structures

In this work we present a paradigm of focusing proof search based on an incremental construction of retractile (i.e, correct or sequen- tializable) proof structures of the pure (units free) multiplicative and ad- ditive fragment of linear logic. The correctness of proof construction steps (or expansion steps) is ensured by means of a system of graph retraction rules; this graph rewriting system is shown to be convergent, that is, terminating and confluent. Moreover, the proposed proof construction follows an optimal (parsimonious, indeed) retraction strategy that, at each expansion step, allows to take into account (abstract) graphs that are ”smaller” (w.r.t. the size) than the starting proof structures.