Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/11513
Título: | Characterising strongly normalising intuitionistic sequent terms |
Autor(es): | Espírito Santo, José Ghilezan, S. Ivetic, J. |
Data: | 2008 |
Editora: | Springer |
Revista: | Lecture Notes in Computer Science |
Citação: | MICULAN, Marino ; SCAGNETTO, Ivan ; HONSELL, Furio, ed. lit. - “Types for proofs and programs : proceedings of the International Conference TYPES'07, Cividale del Friuli, Italy, 2007”. Berlin : Springer, cop. 2008. ISBN 978-3-540-68084-0. p. 85-99. |
Resumo(s): | 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 lambda-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper's sequent term calculus integrates smoothly the lambda-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. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/11513 |
ISBN: | 9783540680840 |
DOI: | 10.1007/978-3-540-68103-8_6 |
ISSN: | 0302-9743 |
Versão da editora: | www.springerlink.com |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
final-jes-sg-ji-types2007.pdf | 198,92 kB | Adobe PDF | Ver/Abrir |