Abstract not found

this paper we show how they can be recast into algorithmic inference rules by applying a combination of standard techniques, among which constraint handling plays a central role. We then analyse the generated constraint sets and show that they share a common structure which can be simplified with a specialised algorithm we present. As the constraint simplification procedure is mainly based on unification, we implemented the whole inference algorithm in a Prolog program which we will comment upon

This report shows how expansion variables enable a unification-based automatic type inference algorithm for System E that finds a typing for every #-normalizable #-term. As a vital part of the proof of this property, it is shown that each step of the unification algorithm corresponds to exactly one #-reduction step, and vice versa. This formally verifies and makes precise a correspondence between type inference and #-reduction that before was only known informally at an intuitive level and only among those who work with intersection types