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.

Appeared as:

@Article{LLDDvB-IaC'04,

Author = "S. Lengrand and P. Lescanne and D. Dougherty and M. Dezani-Ciancaglini and S. van Bakel",
Title = "Intersection types for explicit substitutions",
Journal = "Information and Computation",
Volume = "189",
Number = "1",
Year = "2004",
Pages = "17-42"
}