Show simple item record

Files in this item

Thumbnail
Name:
paper.pdf
Size:
426.9Kb
Format:
PDF
View/Open

Coinductive soundness of corecursive type class resolution

Item metadata

dc.contributor.authorFarka, František
dc.contributor.authorKomendantskaya, Ekaterina
dc.contributor.authorHammond, Kevin
dc.contributor.authorFu, Peng
dc.contributor.editorHermenegildo, Manuel V.
dc.contributor.editorLopez-Garcia, Pedro
dc.date.accessioned2017-06-15T14:30:07Z
dc.date.available2017-06-15T14:30:07Z
dc.date.issued2016-08-18
dc.identifier.citationFarka , F , Komendantskaya , E , Hammond , K & Fu , P 2016 , Coinductive soundness of corecursive type class resolution . in M V Hermenegildo & P Lopez-Garcia (eds) , Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) . arXiv , International Symposium on Logic-based Program Synthesis and Transformation , Edinburgh , United Kingdom , 6/09/16 . < https://arxiv.org/abs/1608.05233 >en
dc.identifier.citationconferenceen
dc.identifier.otherPURE: 245112479
dc.identifier.otherPURE UUID: 8a318703-e2b1-4d7f-8253-328a0a836902
dc.identifier.otherORCID: /0000-0002-4326-4562/work/34005051
dc.identifier.otherWOS: 000441349700018
dc.identifier.urihttps://hdl.handle.net/10023/11004
dc.descriptionThis work has been partially supported by the EU Horizon 2020 grant “RePhrase: Refactoring Parallel Heterogeneous Resource-Aware Applications - a Software Engineering Approach” (ICT-644235), by COST Action IC1202 (TACLe), supported by COST (European Cooperation in Science and Technology), and by EPSRC grant EP/K031864/1-2 “‘Coalgebraic Logic Programming for Type Inference”.en
dc.description.abstractHorn clauses and first-order resolution are commonly used for the implementation of type classes in Haskell. Recently, several core- cursive extensions to type class resolution have been proposed, with the common goal of allowing (co)recursive dictionary construction for those cases when resolution does not terminate. This paper shows, for the first time, that corecursive type class resolution and its recent extensions are coinductively sound with respect to the greatest Herbrand models of logic programs and that they are inductively unsound with respect to the least Herbrand models.
dc.format.extent15
dc.language.isoeng
dc.publisherarXiv
dc.relation.ispartofPre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016)en
dc.rights© 2016 the Authors. This work has been made available online with permission from the authors. This is the author created accepted version manuscript following peer review, and was originally published at: https://arxiv.org/abs/1608.05233en
dc.subjectResolutionen
dc.subjectCoinductionen
dc.subjectHerbrand modelsen
dc.subjectType classesen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.titleCoinductive soundness of corecursive type class resolutionen
dc.typeConference itemen
dc.contributor.sponsorEuropean Commissionen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.urlhttps://arxiv.org/abs/1608.05233en
dc.identifier.grantnumber644235en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.