Coinductive soundness of corecursive type class resolution
MetadataShow full item record
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.
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-8 September . DOI: 10.1007/978-3-319-63139-4_18conference
Logic-Based Program Synthesis and Transformation
© 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_18
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.