Coinductive soundness of corecursive type class resolution
From MaRDI portal
Publication:2409746
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 termi- nate. 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 induc- tively unsound with respect to the least Herbrand models. We establish incompleteness results for various fragments of the proof system.
Recommendations
Cited in
(6)- Logic programming: laxness and saturation
- Proof relevant corecursive resolution
- scientific article; zbMATH DE number 5872252 (Why is no real title available?)
- Proof-relevant Horn clauses for dependent type inference and term synthesis
- Practical Proof Search for Coq by Type Inhabitation
- Coinduction in uniform: foundations for corecursive proof search with Horn clauses
This page was built for publication: Coinductive soundness of corecursive type class resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409746)