Show simple item record

Files in this item

Thumbnail
Name:
paper_9.pdf
Size:
440.0Kb
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.editorHermenegildo, Manuel V
dc.contributor.editorLopez-Garcia, Pedro
dc.date.accessioned2017-08-02T14:30:10Z
dc.date.available2017-08-02T14:30:10Z
dc.date.issued2017
dc.identifier.citationFarka , F , Komendantskaya , E & Hammond , K 2017 , Coinductive soundness of corecursive type class resolution . in M V Hermenegildo & P Lopez-Garcia (eds) , Logic-Based Program Synthesis and Transformation : 26th International Symposium, LOPSTR 2016, Edinburgh, Scotland, UK, September 6-8, 2016. Revised Selected Papers . Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) , vol. 10184 , Springer , Cham , pp. 311-327 , International Symposium on Logic-based Program Synthesis and Transformation , Edinburgh , United Kingdom , 6/09/16 . https://doi.org/10.1007/978-3-319-63139-4_18en
dc.identifier.citationconferenceen
dc.identifier.isbn9783319631387
dc.identifier.isbn9783319631394
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 250119584
dc.identifier.otherPURE UUID: 7674f528-c076-433a-adec-c0eea5874b42
dc.identifier.otherScopus: 85028345150
dc.identifier.otherORCID: /0000-0002-4326-4562/work/35798656
dc.identifier.otherWOS: 000441349700018
dc.identifier.urihttps://hdl.handle.net/10023/11356
dc.descriptionThis work has been supported by the EPSRC grant “Coalgebraic Logic Programming for Type Inference” EP/K031864/1-2, EU Horizon 2020 grant “RePhrase: Refactoring Parallel Heterogeneous Resource-Aware Applications - a Software Engineering Approach” (ICT-644235), and by COST Action IC1202 (TACLe), supported by COST (European Cooperation in Science and Technology)en
dc.description.abstractHorn clauses and first-order resolution are commonly used to implement type classes in Haskell. Several corecursive extensions to type class resolution have recently been proposed, with the goal of allowing (co)recursive dictionary construction where resolution does not terminate. This paper shows, for the first time, that corecursive type class resolution and its 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. We establish incompleteness results for various fragments of the proof system.
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofLogic-Based Program Synthesis and Transformationen
dc.relation.ispartofseriesLecture Notes in Computer Science (Theoretical Computer Science and General Issues)en
dc.rights© 2017, Springer International Publishing AG 2017. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / http://doi.org/10.1007/978-3-319-63139-4_18en
dc.subjectResolutionen
dc.subjectCoinductionen
dc.subjectHerbrand modelsen
dc.subjectType classesen
dc.subjectHaskellen
dc.subjectHorn clausesen
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.sponsorEPSRCen
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.doihttps://doi.org/10.1007/978-3-319-63139-4_18
dc.date.embargoedUntil2017-07-25
dc.identifier.grantnumberEP/P020631/1en
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.