Characterising strongly normalising intuitionistic terms
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | , |
Tipo de documento: | Artigo |
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/26886 |
Resumo: | 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. |
id |
RCAP_691255b0fa113db45fde8c18dfc453e6 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/26886 |
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 termsSequent calculusStrong normalisationIntersection typesIntuitionistic logicScience & TechnologyThis 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.Fundação para a Ciência e TecnologiaIOS PressUniversidade do MinhoEspírito Santo, JoséIvetic, J,Likavec, Silvia20122012-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/26886eng0169-296810.3233/FI-2012-772info: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:RCAAP2023-07-21T12:09:11Zoai:repositorium.sdum.uminho.pt:1822/26886Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:00:32.175900Repositó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 terms |
title |
Characterising strongly normalising intuitionistic terms |
spellingShingle |
Characterising strongly normalising intuitionistic terms Espírito Santo, José Sequent calculus Strong normalisation Intersection types Intuitionistic logic Science & Technology |
title_short |
Characterising strongly normalising intuitionistic terms |
title_full |
Characterising strongly normalising intuitionistic terms |
title_fullStr |
Characterising strongly normalising intuitionistic terms |
title_full_unstemmed |
Characterising strongly normalising intuitionistic terms |
title_sort |
Characterising strongly normalising intuitionistic terms |
author |
Espírito Santo, José |
author_facet |
Espírito Santo, José Ivetic, J, Likavec, Silvia |
author_role |
author |
author2 |
Ivetic, J, Likavec, Silvia |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Espírito Santo, José Ivetic, J, Likavec, Silvia |
dc.subject.por.fl_str_mv |
Sequent calculus Strong normalisation Intersection types Intuitionistic logic Science & Technology |
topic |
Sequent calculus Strong normalisation Intersection types Intuitionistic logic Science & Technology |
description |
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. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012 2012-01-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/26886 |
url |
http://hdl.handle.net/1822/26886 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0169-2968 10.3233/FI-2012-772 |
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 |
IOS Press |
publisher.none.fl_str_mv |
IOS Press |
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 |
|
_version_ |
1799132400793419776 |