Type inference for GADTs and anti-unification

Bibliographic Details
Main Author: Gelain A.*
Publication Date: 2015
Other Authors: Camarao C., Ribeiro R., Vasconcellos, Cristiano Damiani
Format: Conference object
Language: eng
Source: Repositório Institucional da Udesc
dARK ID: ark:/33523/0013000001xbj
Download full: https://repositorio.udesc.br/handle/UDESC/8170
Summary: © Springer International Publishing Switzerland 2015.Nowadays the support of generalized algebraic data types (GADTs) in extensions of Haskell allows functions defined over GADTs to be written without the need for type annotations in some cases and requires type annotations in other cases. In this paper we present a type inference algorithm for GADTs that is based on a closed-world approach to overloading and uses anti-unification and constraint-set satisfiability to infer the relationship between the types of function arguments and result. Through some examples, we show how the proposed algorithm allows more functions defined over GADTs to be written without the need for type annotations.
id UDESC-2_ff6ae048c438c5be9c28826a751df384
oai_identifier_str oai:repositorio.udesc.br:UDESC/8170
network_acronym_str UDESC-2
network_name_str Repositório Institucional da Udesc
repository_id_str 6391
spelling Type inference for GADTs and anti-unification© Springer International Publishing Switzerland 2015.Nowadays the support of generalized algebraic data types (GADTs) in extensions of Haskell allows functions defined over GADTs to be written without the need for type annotations in some cases and requires type annotations in other cases. In this paper we present a type inference algorithm for GADTs that is based on a closed-world approach to overloading and uses anti-unification and constraint-set satisfiability to infer the relationship between the types of function arguments and result. Through some examples, we show how the proposed algorithm allows more functions defined over GADTs to be written without the need for type annotations.2024-12-06T14:00:14Z2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectp. 16 - 301611-334910.1007/978-3-319-24012-1_2https://repositorio.udesc.br/handle/UDESC/8170ark:/33523/0013000001xbjLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)9325Gelain A.*Camarao C.Ribeiro R.Vasconcellos, Cristiano Damianiengreponame:Repositório Institucional da Udescinstname:Universidade do Estado de Santa Catarina (UDESC)instacron:UDESCinfo:eu-repo/semantics/openAccess2024-12-07T20:56:38Zoai:repositorio.udesc.br:UDESC/8170Biblioteca Digital de Teses e Dissertaçõeshttps://pergamumweb.udesc.br/biblioteca/index.phpPRIhttps://repositorio-api.udesc.br/server/oai/requestri@udesc.bropendoar:63912024-12-07T20:56:38Repositório Institucional da Udesc - Universidade do Estado de Santa Catarina (UDESC)false
dc.title.none.fl_str_mv Type inference for GADTs and anti-unification
title Type inference for GADTs and anti-unification
spellingShingle Type inference for GADTs and anti-unification
Gelain A.*
title_short Type inference for GADTs and anti-unification
title_full Type inference for GADTs and anti-unification
title_fullStr Type inference for GADTs and anti-unification
title_full_unstemmed Type inference for GADTs and anti-unification
title_sort Type inference for GADTs and anti-unification
author Gelain A.*
author_facet Gelain A.*
Camarao C.
Ribeiro R.
Vasconcellos, Cristiano Damiani
author_role author
author2 Camarao C.
Ribeiro R.
Vasconcellos, Cristiano Damiani
author2_role author
author
author
dc.contributor.author.fl_str_mv Gelain A.*
Camarao C.
Ribeiro R.
Vasconcellos, Cristiano Damiani
description © Springer International Publishing Switzerland 2015.Nowadays the support of generalized algebraic data types (GADTs) in extensions of Haskell allows functions defined over GADTs to be written without the need for type annotations in some cases and requires type annotations in other cases. In this paper we present a type inference algorithm for GADTs that is based on a closed-world approach to overloading and uses anti-unification and constraint-set satisfiability to infer the relationship between the types of function arguments and result. Through some examples, we show how the proposed algorithm allows more functions defined over GADTs to be written without the need for type annotations.
publishDate 2015
dc.date.none.fl_str_mv 2015
2024-12-06T14:00:14Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv 1611-3349
10.1007/978-3-319-24012-1_2
https://repositorio.udesc.br/handle/UDESC/8170
dc.identifier.dark.fl_str_mv ark:/33523/0013000001xbj
identifier_str_mv 1611-3349
10.1007/978-3-319-24012-1_2
ark:/33523/0013000001xbj
url https://repositorio.udesc.br/handle/UDESC/8170
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9325
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv p. 16 - 30
dc.source.none.fl_str_mv reponame:Repositório Institucional da Udesc
instname:Universidade do Estado de Santa Catarina (UDESC)
instacron:UDESC
instname_str Universidade do Estado de Santa Catarina (UDESC)
instacron_str UDESC
institution UDESC
reponame_str Repositório Institucional da Udesc
collection Repositório Institucional da Udesc
repository.name.fl_str_mv Repositório Institucional da Udesc - Universidade do Estado de Santa Catarina (UDESC)
repository.mail.fl_str_mv ri@udesc.br
_version_ 1848168316035661824

Similar Items