Type-based termination of recursive definitions

Detalhes bibliográficos
Autor(a) principal: Barthe, Gilles Jacques Denis
Data de Publicação: 2004
Outros Autores: Frade, M. J., Giménez, E., Pinto, Luís F., Uustalu, Tarmo
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/1977
Resumo: This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types and recursive function definitions with termination ensured by types. The system is shown to enjoy subject reduction, strong normalisation of typable terms and to be stronger than a related system "lambda-G" in which termination is ensured by a syntactic guard condition. The system can, at will, be extended to also support coinductive types and corecursive function definitions.
id RCAP_b74187068cf823164fbc805ebe6721d4
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/1977
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 Type-based termination of recursive definitionsType theoryLambda-calculusTerminationScience & TechnologyThis paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types and recursive function definitions with termination ensured by types. The system is shown to enjoy subject reduction, strong normalisation of typable terms and to be stronger than a related system "lambda-G" in which termination is ensured by a syntactic guard condition. The system can, at will, be extended to also support coinductive types and corecursive function definitions.Information Society Technologies (IST) - Fifth Framework Programm (FP5) - TYPES.Fundação para a Ciência e a Tecnologia (FCT) – PRAXIS XXI/C/EEI/14172/98.INRIA-ICCTI.Estonian Science Foundation (ETF) - grant no. 4155.Cambridge University PressUniversidade do MinhoBarthe, Gilles Jacques DenisFrade, M. J.Giménez, E.Pinto, Luís F.Uustalu, Tarmo20042004-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/1977eng"Mathematical structures in computer science". ISSN 0960-1295. 14:1 (2004) 97-141.0960-129510.1017/S0960129503004122info: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:28:39Zoai:repositorium.sdum.uminho.pt:1822/1977Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:23:30.363672Repositó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 Type-based termination of recursive definitions
title Type-based termination of recursive definitions
spellingShingle Type-based termination of recursive definitions
Barthe, Gilles Jacques Denis
Type theory
Lambda-calculus
Termination
Science & Technology
title_short Type-based termination of recursive definitions
title_full Type-based termination of recursive definitions
title_fullStr Type-based termination of recursive definitions
title_full_unstemmed Type-based termination of recursive definitions
title_sort Type-based termination of recursive definitions
author Barthe, Gilles Jacques Denis
author_facet Barthe, Gilles Jacques Denis
Frade, M. J.
Giménez, E.
Pinto, Luís F.
Uustalu, Tarmo
author_role author
author2 Frade, M. J.
Giménez, E.
Pinto, Luís F.
Uustalu, Tarmo
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Barthe, Gilles Jacques Denis
Frade, M. J.
Giménez, E.
Pinto, Luís F.
Uustalu, Tarmo
dc.subject.por.fl_str_mv Type theory
Lambda-calculus
Termination
Science & Technology
topic Type theory
Lambda-calculus
Termination
Science & Technology
description This paper introduces "lambda-hat", a simply typed lambda calculus supporting inductive types and recursive function definitions with termination ensured by types. The system is shown to enjoy subject reduction, strong normalisation of typable terms and to be stronger than a related system "lambda-G" in which termination is ensured by a syntactic guard condition. The system can, at will, be extended to also support coinductive types and corecursive function definitions.
publishDate 2004
dc.date.none.fl_str_mv 2004
2004-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/1977
url http://hdl.handle.net/1822/1977
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv "Mathematical structures in computer science". ISSN 0960-1295. 14:1 (2004) 97-141.
0960-1295
10.1017/S0960129503004122
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 Cambridge University Press
publisher.none.fl_str_mv Cambridge University 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_ 1799132710464126976

Registros relacionados