Confluence and strong normalisation of the generalised multiary lambda-calculus
Autor(a) principal: | |
---|---|
Data de Publicação: | 2004 |
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/3911 |
Resumo: | In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an extension of the $\lambda$-calculus where functions can be applied to lists of arguments (a feature which we call "multiarity'') and encompassing "generalised'' eliminations of von Plato. In this paper we prove confluence and strong normalisation of the reduction relations of lambda-Jm. Proofs of these results lift corresponding ones obtained by Joachimski and Matthes for the system $\Lambda J$. Such lifting requires the study of how multiarity and some forms of generality can express each other. This study identifies a variant of $\Lambda J$, and another system isomorphic to it, as being the subsystems of lambda-Jm with, respectively, minimal and maximal use of multiarity. We argue then that lambda-Jm is the system with the right use of multiarity. |
id |
RCAP_8897acace3f22da0a6a490fcb181cda4 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/3911 |
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 |
Confluence and strong normalisation of the generalised multiary lambda-calculus$\lambda$-calculusConfluenceStrong normalisationSequent calculusScience & TechnologyIn a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an extension of the $\lambda$-calculus where functions can be applied to lists of arguments (a feature which we call "multiarity'') and encompassing "generalised'' eliminations of von Plato. In this paper we prove confluence and strong normalisation of the reduction relations of lambda-Jm. Proofs of these results lift corresponding ones obtained by Joachimski and Matthes for the system $\Lambda J$. Such lifting requires the study of how multiarity and some forms of generality can express each other. This study identifies a variant of $\Lambda J$, and another system isomorphic to it, as being the subsystems of lambda-Jm with, respectively, minimal and maximal use of multiarity. We argue then that lambda-Jm is the system with the right use of multiarity.Fundação para a Ciência e a Tecnologia (FCT).SpringerUniversidade do MinhoEspírito Santo, JoséPinto, Luís F.20042004-01-01T00:00:00Zbook partinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/3911engBERARDI, Stefano ; COPPO, Mario ; DAMIANI, Ferruccio, eds. – “Types for proofs and programs : international workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003 : revised selected papers. Berlin [etc.] : Springer, cop. 2004. ISBN 3-540-22164-6. p. 194-209.35402216460077-8923info: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-11T05:28:35Zoai:repositorium.sdum.uminho.pt:1822/3911Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-05-11T05:28:35Repositó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 |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
title |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
spellingShingle |
Confluence and strong normalisation of the generalised multiary lambda-calculus Espírito Santo, José $\lambda$-calculus Confluence Strong normalisation Sequent calculus Science & Technology |
title_short |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
title_full |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
title_fullStr |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
title_full_unstemmed |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
title_sort |
Confluence and strong normalisation of the generalised multiary lambda-calculus |
author |
Espírito Santo, José |
author_facet |
Espírito Santo, José Pinto, Luís F. |
author_role |
author |
author2 |
Pinto, Luís F. |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Espírito Santo, José Pinto, Luís F. |
dc.subject.por.fl_str_mv |
$\lambda$-calculus Confluence Strong normalisation Sequent calculus Science & Technology |
topic |
$\lambda$-calculus Confluence Strong normalisation Sequent calculus Science & Technology |
description |
In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an extension of the $\lambda$-calculus where functions can be applied to lists of arguments (a feature which we call "multiarity'') and encompassing "generalised'' eliminations of von Plato. In this paper we prove confluence and strong normalisation of the reduction relations of lambda-Jm. Proofs of these results lift corresponding ones obtained by Joachimski and Matthes for the system $\Lambda J$. Such lifting requires the study of how multiarity and some forms of generality can express each other. This study identifies a variant of $\Lambda J$, and another system isomorphic to it, as being the subsystems of lambda-Jm with, respectively, minimal and maximal use of multiarity. We argue then that lambda-Jm is the system with the right use of multiarity. |
publishDate |
2004 |
dc.date.none.fl_str_mv |
2004 2004-01-01T00:00:00Z |
dc.type.driver.fl_str_mv |
book part |
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/3911 |
url |
http://hdl.handle.net/1822/3911 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
BERARDI, Stefano ; COPPO, Mario ; DAMIANI, Ferruccio, eds. – “Types for proofs and programs : international workshop, TYPES 2003, Torino, Italy, April 30 - May 4, 2003 : revised selected papers. Berlin [etc.] : Springer, cop. 2004. ISBN 3-540-22164-6. p. 194-209. 3540221646 0077-8923 |
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_ |
1817544633823002624 |