%0 Journal Article
%T Some Computational Properties of Intersection Types (Extended Abstract)
%A Bucciarelli, Antonio
%A de Lorenzis, Silvia
%A Piperno, Adolfo
%A Salvo, Ivano
%D 1999
%I IEEE Computer Society
%F Bucciarelli_etal1999
%O exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=71), last updated on Thu, 22 Nov 2012 14:59:18 +0100
%X This paper presents a new method for comparing computation-properties of λ-terms typeable with intersection types with respect to terms typeable with Curry types. In particular, strong normalization and λ-definability are investigated. A translation is introduced from intersection typing derivations to Curry typeable terms; the main feature of the proposed technique is that the translation is preserved by β-reduction. This allows to simulate a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach naturally leads to prove strong normalization in the intersection system by means of purely syntactical techniques. In addition, the presented method enables us to give a proof of a conjecture proposed by Leivant in 1990, namely that all functions uniformly definable using intersection types are already definable using Curry types.
%K lambda calculusCurry types
%K intersection types
%K lambda-definability
%K lambda-terms
%K strong normalization
%R 10.1109/LICS.1999.782598
%U http://mclab.di.uniroma1.it/publications/papers/papers/Bucciarelli1999.pdf
%U https://doi.org/10.1109/LICS.1999.782598
%P 109-118