Strong normalization of Herbelin's explicit substitution calculus with substitution propagation
Herbelin presented (at CSL'94) a simple sequent calculus for minimal implicational logic, extensible to full firstorder intuitionistic logic, with a complete system of cut-reduction rules which is both confluent and strongly normalizing. Some of the cut rules may be regarded as rules to construct explicit substitutions. He observed that the addition of a cut permutation rule, for propagation of such substitutions, breaks the proof of strong normalization; the implicit conjecture is that the rule may be added without breaking strong normalization. We prove this conjecture, thusshowing how to model beta-reduction in his calculus (extended with rules toallow cut permutations).
strong normalization explicit substitution lambda-calculus