typedKanren: Statically Typed Relational Programming with Exhaustive Matching in Haskell

A statically typed embedding of miniKanren in Haskell with disequality constraints and a variation of relational matching that supports static exhaustiveness checks.

Workshop talk delivered by Artem Starikov.

Download PDF

Video Recording

Code: snejugal/typedKanren

Kudasov, N., Starikov, A. (2024). "typedKanren: Statically Typed Relational Programming with Exhaustive Matching in Haskell." Proceedings of the 2024 miniKanren and Relational Programming Workshop, co-located with ICFP 2024, Milan, Italy. arXiv:2408.03170.