Nominal essential intersection types

Abstract

Nominal systems are an alternative approach for the treatment of variables in computational systems, where first-order syntax is generalised to provide support for the specification of binding operators. In this work, an intersection type system is presented for nominal terms. The subject reduction property is shown to hold for a specialised notion of typed nominal rewriting, thus ensuring preservation of types under computational execution.