Skip to Main content Skip to Navigation
Journal articles

Intersection types for explicit substitutions

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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00150285
Contributor : Stéphane Graham-Lengrand Connect in order to contact the contributor
Submitted on : Wednesday, May 30, 2007 - 2:07:20 AM
Last modification on : Friday, September 10, 2021 - 2:34:03 PM

Identifiers

  • HAL Id : hal-00150285, version 1

Citation

Stéphane Lengrand, Pierre Lescanne, Dan Dougherty, Mariangiola Dezani, Steffen van Bakel. Intersection types for explicit substitutions. Information and Computation, Elsevier, 2004, 189 (1), pp.17 - 42. ⟨hal-00150285⟩

Share

Metrics

Record views

301