
Glueability of resource proofstructures: inverting the Taylor expansion (long version)
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be ...
read it

Taylor expansion in linear logic is invertible
Each Multiplicative Exponential Linear Logic (MELL) proofnet can be exp...
read it

Normalization, Taylor expansion and rigid approximation of λterms
The aim of this work is to characterize three fundamental normalization ...
read it

Complete topological asymptotic expansion for L_2 and H^1 trackingtype cost functionals in dimension two and three
In this paper, we study the topological asymptotic expansion of a topolo...
read it

Upto Techniques for Branching Bisimilarity
Ever since the introduction of behavioral equivalences on processes one ...
read it

An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets
We examine some combinatorial properties of parallel cut elimination in ...
read it

MorphNet: Fast & Simple ResourceConstrained Structure Learning of Deep Networks
We present MorphNet, an approach to automate the design of neural networ...
read it
Gluing resource proofstructures: inhabitation and inverting the Taylor expansion
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be expanded into a set of resource proofstructures: its Taylor expansion. We introduce a new criterion characterizing those sets of resource proofstructures that are part of the Taylor expansion of some MELL proofstructure, through a rewriting system acting both on resource and MELL proofstructures. As a consequence, we prove also the semidecidability of the type inhabitation problem for MELL proofstructures.
READ FULL TEXT
Comments
There are no comments yet.