Alpha-Conversion and Typability

Author: Kfoury A.J.   Ronchi della Rocca S.   Tiuryn J.   Urzyczyn P.  

Publisher: Academic Press

ISSN: 0890-5401

Source: Information and Computation, Vol.150, Iss.1, 1999-04, pp. : 1-21

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

There are two results in this paper. We first prove that alpha-conversion on types can be eliminated from the second-order λ-calculus F of Girard and Reynolds without affecting the typing power of the system. On the other hand we show that it is impossible to eliminate alpha-conversion on universally quantified variables in the higher-order λ-calculus Fω of Girard, by exhibiting a term which is typable in Fω with alpha-conversion but not typable in Fω without alpha-conversion. Copyright 1999 Academic Press.