The heart of intersection type assignment: Normalisation proofs revisited

Authors:
Steffen van Bakel
Affiliations:
Department of Computing, Imperial College London, 180 Queens Gate London SW7 2BZ, UK
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 2

Proofs and types

Proofs and types
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Normalization results for typeable rewrite systems

Information and Computation
Approximation and Normalization Results for Typeable Term Rewriting Systems

HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting

Strict intersection types for the Lambda Calculus

ACM Computing Surveys (CSUR)
Semantic Types and Approximation for Featherweight Java

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types for a system with 'w and a @?-relation that is contra-variant over arrow types. The technique applied is to define reduction on derivations and to show a strong normalisation result for this reduction. From this result, the characterisation of strong normalisation and the approximation result will follow easily; the latter, in its turn, will lead to the characterisation of (head) normalisability.