Characterising strongly normalising intuitionistic sequent terms
Autor(a) principal: | |
---|---|
Data de Publicação: | 2008 |
Outros Autores: | , |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/1822/11513 |
Resumo: | 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. |
id |
RCAP_231e8db4137d49c4cbdf6567931ffd37 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/11513 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Characterising strongly normalising intuitionistic sequent termsScience & TechnologyThis 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.SpringerUniversidade do MinhoEspírito Santo, JoséGhilezan, S.Ivetic, J.20082008-01-01T00:00:00Zconference paperinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/11513engMICULAN, 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.97835406808400302-974310.1007/978-3-540-68103-8_6www.springerlink.cominfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-05-11T04:25:28Zoai:repositorium.sdum.uminho.pt:1822/11513Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-05-11T04:25:28Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Characterising strongly normalising intuitionistic sequent terms |
title |
Characterising strongly normalising intuitionistic sequent terms |
spellingShingle |
Characterising strongly normalising intuitionistic sequent terms Espírito Santo, José Science & Technology |
title_short |
Characterising strongly normalising intuitionistic sequent terms |
title_full |
Characterising strongly normalising intuitionistic sequent terms |
title_fullStr |
Characterising strongly normalising intuitionistic sequent terms |
title_full_unstemmed |
Characterising strongly normalising intuitionistic sequent terms |
title_sort |
Characterising strongly normalising intuitionistic sequent terms |
author |
Espírito Santo, José |
author_facet |
Espírito Santo, José Ghilezan, S. Ivetic, J. |
author_role |
author |
author2 |
Ghilezan, S. Ivetic, J. |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Espírito Santo, José Ghilezan, S. Ivetic, J. |
dc.subject.por.fl_str_mv |
Science & Technology |
topic |
Science & Technology |
description |
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. |
publishDate |
2008 |
dc.date.none.fl_str_mv |
2008 2008-01-01T00:00:00Z |
dc.type.driver.fl_str_mv |
conference paper |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/11513 |
url |
http://hdl.handle.net/1822/11513 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
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. 9783540680840 0302-9743 10.1007/978-3-540-68103-8_6 www.springerlink.com |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
mluisa.alvim@gmail.com |
_version_ |
1817544305311481856 |