 Recent important work by Dunn (2015) ties substructural logics and structural rules together with informational relevance in the following way. Dunn makes a distinction between  programs and data, with the former being dynamic and the latter static. We may think of programs as conditional statements of the form \(A \rightarrow B\), and of data as atomic propositions \(A, B\) etc. Given these two types of information artefacts, we have three possible combinations, program to data combination, program to program combination, and data to data combination. For program to data combination, commutation will hold whilst weakening and association will fail, and contraction not applying. For program to program combination association will hold, whilst commutation, weakening fail. As demonstrated in Sequoiah-Grayson (2016), the case of contraction for program to program combination is more complicated. The exact properties of data to data combination remain an interesting open issue. The connection with informational relevance is made by interpreting the partial order relation \(\sqsubseteq\) as marking information relevance itself. In this case, \(x \sqsubseteq y\) is read as the information x is relevant to the information y. To what it is exactly that informational relevance amounts will depend on the precise context of information processing in question. Sequoiah-Grayson (2016) extends the framework about to contexts of information processing by an agent as the agent reasons explicitly. Given that the combination of information states \(x \bullet y\) may sit on the left hand side of the partial order relation, the extension is an account of the epistemic relevance of epistemic actions. For a collection of recent papers exploring the information as code approach in depth, see Bimbo (2016).