Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/9269
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFigueiredo, Carlos Camarão de-
dc.contributor.authorFigueiredo, Lucília Camarão de-
dc.contributor.authorRibeiro, Rodrigo Geraldo-
dc.date.accessioned2018-01-18T13:38:50Z-
dc.date.available2018-01-18T13:38:50Z-
dc.date.issued2016-
dc.identifier.citationFIGUEIREDO, C. C. de; FIGUEIREDO, L. C. de; RIBEIRO, R. G. Ambiguity and constrained polymorphism. Science of Computer Programming, v. 124, p.1-19, 2016. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0167642316000836>. Acesso em: 02 out. 2017.pt_BR
dc.identifier.issn01676423-
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/9269-
dc.description.abstractThis paper considers the problem of ambiguity in Haskell-like languages. Overloading resolution is characterized in the context of constrained polymorphism by the presence of unreachable variables in constraints on the type of the expression. A new definition of ambiguity is presented, where existence of more than one instance for the constraints on an expression type is considered only after overloading resolution. This introduces a clear distinction between ambiguity and overloading resolution, makes ambiguity more intuitive and independent from extra concepts, such as functional dependencies, and enables more programs to type-check as fewer ambiguities arise. The paper presents a type system and a type inference algorithm that includes: a constraint-set satisfiability function, that determines whether a given set of constraints is entailed or not in a given context, focusing on issues related to decidability, a constraint-set improvement function, for filtering out constraints for which overloading has been resolved, and a context-reduction function, for reducing constraint sets according to matching instances. A standard dictionary-style semantics for core Haskell is also presented.pt_BR
dc.language.isoen_USpt_BR
dc.rightsabertopt_BR
dc.subjectAmbiguitypt_BR
dc.subjectContext-dependent overloadingpt_BR
dc.subjectHaskellpt_BR
dc.titleAmbiguity and constrained polymorphism.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.rights.licenseO Periódico Science of Computer Programming concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 4230720311201.pt_BR
Appears in Collections:DECSI - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_AmbiguityConstrainedPolymorphism.pdf502,18 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.