Section: New Results
Proofs of Strong Normalisation
Participants : Jean-Jacques Lévy, Giulio Manzonetto.
The usual proofs of strong normalisation are quite enigmatic in the typed lambda calculus, proofs by realisability, reductibility (Tait), candidats de réductibilité (Girard), saturated sets (Krivine). We tried to exhibit more intuitive proof techniques. If this can easily be done in first-order typed lambda calculus, it is less clear of System F or other higher-order typed calculi.
In 2009, we started to work actively on this rather fundamental topic, and hope to get results in 2010.