Characterising strongly normalising intuitionistic terms

• Autor(es): Espírito Santo, José ; Ivetic, J, ; Likavec, Silvia
• Data: 2012
• Identificador Persistente: http://hdl.handle.net/1822/26886
• Origem: RepositóriUM - Universidade do Minho
• Assunto(s): Sequent calculus; Strong normalisation; Intersection types; Intuitionistic logic
• Tipo de Documento: Artigo
• Idioma: Inglês

Descrição

This paper gives a characterisation, via intersection types, of the strongly normalising proof-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 lambdal-calculus. The completeness of the typing system is obtained from subject expansion at root position. Next we use our result to analyze the characterisation of strong normalisability for three classes of intuitionistic terms: ordinary lambda-terms, LambdaJ-terms (lambda-terms with generalised application), and lambdax-terms (lambda-terms with explicit substitution). We explain via our system why the type systems iin the natural deduction format for LambdaJ and lambdax known from the literature contain extra, exceptional rules for typing generalised application or substitution; and we show a new characterisation of the beta-strongly normalising l-terms, as a corollary to a PSN-result, relating the lambda-calculus and the intuitionistic sequent calculus. Finally, we obtain variants of our characterisation by restricting the set of assignable types to sub-classes of intersection types, notably strict types. In addition, the known characterisation of the beta-strongly normalising lambda-terms in terms of assignment of strict types follows as an easy corollary of our results.