Intersection type assignment systems with higher-order algebraic rewriting

Abstract

General computational models obtained by integrating different specific models have recently become a stimulating and promising research subject. In particular, extensions of various λ-calculi with algebraic rewriting, either typed or untyped, have been deeply investigated. In the present paper this subject is addressed from the point of view of type assignment. A powerful type assignment system, the one based on intersection types, is extended with first- and higher-order algebraic rewriting, and relevant properties, like strong normalization and completeness, are proved.