Coinductive soundness of corecursive type class resolution

František Farka, Ekaterina Komendantskaya, Kevin Hammond

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)
14 Downloads (Pure)

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.

Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation
Subtitle of host publicationLOPSTR 2016
PublisherSpringer
Pages311-327
Number of pages17
ISBN (Electronic)9783319631394
ISBN (Print)9783319631387
DOIs
Publication statusPublished - 25 Jul 2017

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Coinduction
  • Haskell
  • Herbrand models
  • Horn clauses
  • Resolution
  • Type classes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Coinductive soundness of corecursive type class resolution'. Together they form a unique fingerprint.

  • Cite this

    Farka, F., Komendantskaya, E., & Hammond, K. (2017). Coinductive soundness of corecursive type class resolution. In Logic-Based Program Synthesis and Transformation: LOPSTR 2016 (pp. 311-327). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-319-63139-4_18