Intersection types for explicit substitutions

  • Authors:

  • Stéphane Lengrand;Pierre Lescanne;Dan Dougherty;Mariangiola Dezani-Ciancaglini;Steffen van Bakel

  • Affiliations:

  • École Normale Supérieure de Lyon 46, Allée d'Italie, 69364 Lyon 07, France;École Normale Supérieure de Lyon 46, Allée d'Italie, 69364 Lyon 07, France;Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA;Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy;Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK

  • Venue:
  • Information and Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new system of intersection types for a composition-free calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not complete for strong normalization. An important role is played by the notion of available variable in a term, which is a generalization of the classical notion of free variable.