Coinductive soundness of corecursive type class resolution
MetadataShow full item record
Horn 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.
Farka , 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-8 September .conference
Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016)
© 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.05233
This 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”.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.