Proof nets and explicit substitutions

  • Authors:

  • Roberto Di Cosmo;Delia Kesner;Emmanuel Polonovski

  • Affiliations:

  • PPS (CNRS UMR 7126), Université Paris 7, 175, rue du Chevaleret, Paris, France Email: dicosmo@pps.jussieu.fr;LRI (CNRS UMR 8623), Bât 490, Université de Paris-Sud, 91405 Orsay Cedex, France Email: kesner@lri.fr;PPS (CNRS UMR 7126), Université Paris 7, 175, rue du Chevaleret, Paris, France Email: polonovs@pps.jussieu.fr

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We refine the simulation technique introduced in Di Cosmo and Kesner (1997) to show strong normalisation of $\l$-calculi with explicit substitutions via termination of cut elimination in proof nets (Girard 1987). We first propose a notion of equivalence relation for proof nets that extends the one in Di Cosmo and Guerrini (1999), and show that cut elimination modulo this equivalence relation is terminating. We then show strong normalisation of the typed version of the $\ll$-calculus with de Bruijn indices (a calculus with full composition defined in David and Guillaume (1999)) using a translation from typed $\ll$ to proof nets. Finally, we propose a version of typed $\ll$ with named variables, which helps to give a better understanding of the complex mechanism of the explicit weakening notation introduced in the $\ll$-calculus with de Bruijn indices (David and Guillaume 1999).