  Computational interpretations of linear logic allow static control of memory
resources: the data produced by the program are endowed through its type with
attributes that determine its life cycle, and guarantee safe deallocation. The
use of linear types encounters limitations in practice, since linear data, in
the traditional sense, do not so often appear in actual programs. Several
alternatives have been proposed in the attempt to relax the condition of
linearity, adding coercions to the language to allow linear objects to be
temporarily aliased. In this work we propose a new alternative, whose virtue is
to preserve the simplicity and elegance of the original system.
