Authors: Espírito Santo, José
Ghilezan, Silvia 
Ivetić, Jelena
Title: Characterising strongly normalising intuitionistic sequent terms
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 4941 LNCS
First page: 85
Last page: 99
Conference: International Conference on Types for Proofs and Programs, TYPES 2007; Cividale del Friuli; Italy; 2 May 2007 through 5 May 2007
Issue Date: 9-Jun-2008
Rank: M23
ISBN: 978-3-540-68084-5
ISSN: 0302-9743
DOI: 10.1007/978-3-540-68103-8_6
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.
Publisher: Springer Link

Show full item record


checked on May 16, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.