Characterising Strongly Normalising Intuitionistic Sequent Terms

This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper’s sequent term calculus integrates smoothly the λ-terms with generalised application or explicit substitution. Strong normalisability of these terms as sequent terms characterises their typeability in certain “natural” typing systems with intersection types. The latter are in the natural deduction format, like systems previously studied by Matthes and Lengrand et al., except that they do not contain any extra, exceptional rules for typing generalised applications or substitution.

• Type: Conference
• Year: 2007
• Where: TYPES
• Authors: José Espírito Santo, Silvia Ghilezan, J. Ivetic
• Keywords: Formal Methods, Intersection Types, Sequent Terms, TYPES 2007, Typing