Typability and type inference in atomic polymorphism

Detalhes bibliográficos
Autor(a) principal: Protin, M. Clarence
Data de Publicação: 2022
Outros Autores: Ferreira, Gilda
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/10400.2/12603
Resumo: It is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F. It has recently been proven that type inhabitation remains undecidable even in the predicative fragment of system F in which all universal instantiations have an atomic witness (system Fat). In this paper we analyze typability and type inference in Curry style variants of system Fat and show that typability is decidable and that there is an algorithm for type inference which is capable of dealing with non-redundancy constraints.
id RCAP_950ca04469cff7986d6c7c414f5da1af
oai_identifier_str oai:repositorioaberto.uab.pt:10400.2/12603
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 Typability and type inference in atomic polymorphismLambda calculusAtomic polymorphismTypabilityType inferenceIntuitionistic logicIt is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F. It has recently been proven that type inhabitation remains undecidable even in the predicative fragment of system F in which all universal instantiations have an atomic witness (system Fat). In this paper we analyze typability and type inference in Curry style variants of system Fat and show that typability is decidable and that there is an algorithm for type inference which is capable of dealing with non-redundancy constraints.The second author acknowledges the support of FCT — Fundação para a Ciência e a Tecnologia under the projects UIDB/04561/2020, UIDB/00408/2020 and UIDP/00408/2020, and she is also grateful to CMAFcIO — Centro de Matemática, Aplicações Fundamentais e Investigação Operacional and to LASIGE — Computer Science and Engineering Research Centre (Universidade de Lisboa).Repositório AbertoProtin, M. ClarenceFerreira, Gilda2022-11-21T09:06:39Z20222022-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.2/12603eng1860-597410.46298/lmcs-18(3:22)2022info: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-11-16T15:42:55Zoai:repositorioaberto.uab.pt:10400.2/12603Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T22:51:50.304602Repositó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 Typability and type inference in atomic polymorphism
title Typability and type inference in atomic polymorphism
spellingShingle Typability and type inference in atomic polymorphism
Protin, M. Clarence
Lambda calculus
Atomic polymorphism
Typability
Type inference
Intuitionistic logic
title_short Typability and type inference in atomic polymorphism
title_full Typability and type inference in atomic polymorphism
title_fullStr Typability and type inference in atomic polymorphism
title_full_unstemmed Typability and type inference in atomic polymorphism
title_sort Typability and type inference in atomic polymorphism
author Protin, M. Clarence
author_facet Protin, M. Clarence
Ferreira, Gilda
author_role author
author2 Ferreira, Gilda
author2_role author
dc.contributor.none.fl_str_mv Repositório Aberto
dc.contributor.author.fl_str_mv Protin, M. Clarence
Ferreira, Gilda
dc.subject.por.fl_str_mv Lambda calculus
Atomic polymorphism
Typability
Type inference
Intuitionistic logic
topic Lambda calculus
Atomic polymorphism
Typability
Type inference
Intuitionistic logic
description It is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F. It has recently been proven that type inhabitation remains undecidable even in the predicative fragment of system F in which all universal instantiations have an atomic witness (system Fat). In this paper we analyze typability and type inference in Curry style variants of system Fat and show that typability is decidable and that there is an algorithm for type inference which is capable of dealing with non-redundancy constraints.
publishDate 2022
dc.date.none.fl_str_mv 2022-11-21T09:06:39Z
2022
2022-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/10400.2/12603
url http://hdl.handle.net/10400.2/12603
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1860-5974
10.46298/lmcs-18(3:22)2022
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.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_ 1799135109873401856

Registros relacionados