Approximation theorems for intersection type systems
In this paper we prove that many intersection type theories of interest (including those which induce as filter models, Scott's and Park's D-infinity models, the models studied in Barendregt Coppo Dezani, Abramsky Ong, and Honsell Ronchi) satisfy an Approximation Theorem with respect to a suitable notion of approximant. This theorem implies that a lambda -term has a type if and only if there exists an approximant of that term which has that type. We prove this result uniformly for all the intersection type theories under consideration using a Kripke version of stable sets where bases correspond to worlds.
approximation theorem intersection types lambda-calculus set-theoretical semantics of types