Strong normalization of explicit substitutions via cut elimination in proof nets

In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for linear logic, via proof nets. This correspondence allows us to prove that a typed version of the λx-calculus is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ_v, λ_s, λ_d and λ_f. In order to achieve this result, we introduce a new notion of reduction in proof nets: this extended reduction is still confluent and strongly normalizing, and is of interest of its own, as it corresponds to more identifications of proofs in linear logic that differ by inessential details. These results show that calculi with explicit substitutions are really an intermediate formalism between lambda calculus and proof nets, and suggest a completely new way to look at the problems still open in the field of explicit substitutions