Implicative Algebras were recently introduced as a unified framework for
forcing and realisability, whose particularity is to interpret terms and
formulæ uniformly.

In this ongoing work with Alexandre Miquel, we show how linear logic
fits in this picture: we present a family of models, where certain
computational principles are distinguished, and argue thata it provides
a satisfactory meaning explanation of the connectives of (perfective)
linear logic.