A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be
expanded into a set of resource proof-structures: its Taylor expansion. We
introduce a new criterion characterizing those sets of resource
proof-structures that are part of the Taylor expansion of some MELL
proof-structure, through a rewriting system acting both on resource and MELL
proof-structures. As a consequence, we also prove semi-decidability of the type
inhabitation problem for cut-free MELL proof-structures.Comment: arXiv admin note: substantial text overlap with arXiv:1910.0793