Typed Embedding of a Relational Language in OCaml
Programming Languages
2019-01-01 v4
Abstract
We present an implementation of the relational programming language miniKanren as a set of combinators and syntax extensions for OCaml. The key feature of our approach is polymorphic unification, which can be used to unify data structures of arbitrary types. In addition we provide a useful generic programming pattern to systematically develop relational specifications in a typed manner, and address the problem of integration of relational subsystems into functional applications.
Keywords
Cite
@article{arxiv.1805.11006,
title = {Typed Embedding of a Relational Language in OCaml},
author = {Dmitrii Kosarev and Dmitry Boulytchev},
journal= {arXiv preprint arXiv:1805.11006},
year = {2019}
}
Comments
In Proceedings ML/OCAML 2016, arXiv:1812.10891