Coinductive soundness of corecursive type class resolution

Farka, František, Komendantskaya, Ekaterina and Hammond, Kevin (2017) Coinductive soundness of corecursive type class resolution. Hermenegildo, Manuel V. and Lopez-Garcia, Pedro (eds.) In Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Revised Selected Papers. vol. 10184, Springer. pp. 311-327 . (doi:10.1007/978-3-319-63139-4_18).

Record type: Conference or Workshop Item (Paper)

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.

This record has no associated files available for download.

More information

Published date: 25 July 2017

Additional Information: Publisher Copyright: © Springer International Publishing AG 2017.

Venue - Dates: 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, , Edinburgh, United Kingdom, 2016-09-06 - 2016-09-08

Keywords: Coinduction, Haskell, Herbrand models, Horn clauses, Resolution, Type classes

Learn more about Cyber Physical Systems research