Typing polymorphic recursion

Autores
Figueiredo, Lucília Camarão de; Camarão, Carlos
Año de publicación
2001
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.
Eje: Informática teórica
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Languages
informática
Polymorphism
Programming languages
Type inference
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23287
Acceder
id SEDICI_c12193459236107006b76a0424c42d87
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23287
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Typing polymorphic recursionFigueiredo, Lucília Camarão deCamarão, CarlosCiencias InformáticasLanguagesinformáticaPolymorphismProgramming languagesType inferenceThis paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.Eje: Informática teóricaRed de Universidades con Carreras en Informática (RedUNCI)2001-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23287enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T10:55:25Zoai:sedici.unlp.edu.ar:10915/23287Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 10:55:25.788SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Typing polymorphic recursion
title Typing polymorphic recursion
spellingShingle Typing polymorphic recursion
Figueiredo, Lucília Camarão de
Ciencias Informáticas
Languages
informática
Polymorphism
Programming languages
Type inference
title_short Typing polymorphic recursion
title_full Typing polymorphic recursion
title_fullStr Typing polymorphic recursion
title_full_unstemmed Typing polymorphic recursion
title_sort Typing polymorphic recursion
dc.creator.none.fl_str_mv Figueiredo, Lucília Camarão de
Camarão, Carlos
author Figueiredo, Lucília Camarão de
author_facet Figueiredo, Lucília Camarão de
Camarão, Carlos
author_role author
author2 Camarão, Carlos
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Languages
informática
Polymorphism
Programming languages
Type inference
topic Ciencias Informáticas
Languages
informática
Polymorphism
Programming languages
Type inference
dc.description.none.fl_txt_mv This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.
Eje: Informática teórica
Red de Universidades con Carreras en Informática (RedUNCI)
description This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.
publishDate 2001
dc.date.none.fl_str_mv 2001-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23287
url http://sedici.unlp.edu.ar/handle/10915/23287
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615812786159616
score 13.070432

Publicaciones similares