Realizability Proof for Normalization of Full Differential Linear Logic
Résumé
Realizability methods allowed to prove normalization results on many typed calculi. Girard adapted these methods to systems of nets and managed to prove normalization of second order Linear Logic. Our contribution is to provide an extension of this proof that embrace Full Differential Linear Logic (a logic that can describe both single-use resources and inexhaustible resources). Anchored within the reducibility framework our proof is modular enough so that further extensions (to second order, to additive constructs or to any other independent feature that can be dealt with using reducibility) come for free.