Files in this item
Coinductive soundness of corecursive type class resolution
Item metadata
dc.contributor.author | Farka, František | |
dc.contributor.author | Komendantskaya, Ekaterina | |
dc.contributor.author | Hammond, Kevin | |
dc.contributor.editor | Hermenegildo, Manuel V | |
dc.contributor.editor | Lopez-Garcia, Pedro | |
dc.date.accessioned | 2017-08-02T14:30:10Z | |
dc.date.available | 2017-08-02T14:30:10Z | |
dc.date.issued | 2017 | |
dc.identifier | 250119584 | |
dc.identifier | 7674f528-c076-433a-adec-c0eea5874b42 | |
dc.identifier | 85028345150 | |
dc.identifier | 000441349700018 | |
dc.identifier.citation | Farka , 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_18 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783319631387 | |
dc.identifier.isbn | 9783319631394 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0002-4326-4562/work/35798656 | |
dc.identifier.uri | https://hdl.handle.net/10023/11356 | |
dc.description | This 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.abstract | Horn 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.format.extent | 450626 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Logic-Based Program Synthesis and Transformation | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) | en |
dc.subject | Resolution | en |
dc.subject | Coinduction | en |
dc.subject | Herbrand models | en |
dc.subject | Type classes | en |
dc.subject | Haskell | en |
dc.subject | Horn clauses | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Coinductive soundness of corecursive type class resolution | en |
dc.type | Conference item | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-319-63139-4_18 | |
dc.date.embargoedUntil | 2017-07-25 | |
dc.identifier.grantnumber | EP/P020631/1 | en |
dc.identifier.grantnumber | 644235 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.