Intersection types and λ-definability

  • Authors:
  • Antonio Bucciarelli;Adolfo Piperno;Ivano Salvo

  • Affiliations:
  • PPS, Université Paris 7, 2 Place Jussieu, 75251 Paris Cedex 05, France Email: buccia@pps.jussieu.fr;Dipartimento di Scienze dell'Informazione, Università di Roma ‘La Sapienza’, Via Salaria 113, 00198 Roma, Italy Email: piperno@dsi.uniroma1.it;Dipartimento di Informatica, Università di Torino, C.so Svizzera 185, 10149 Torino, Italy Email: salvo@di.unito.it

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a novel method for comparing computational properties of λ-terms that are typeable with intersection types, with respect to terms that are typeable with Curry types. We introduce a translation from intersection typing derivations to Curry typeable terms that is preserved by β-reduction: this allows the simulation of a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach proves strong normalisation for the intersection system naturally by means of purely syntactical techniques. The paper extends the results presented in Bucciarelli et al. (1999) to the whole intersection type system of Barendregt, Coppo and Dezani, thus providing a complete proof of the conjecture, proposed in Leivant (1990), that all functions uniformly definable using intersection types are already definable using Curry types.