pith. sign in

arxiv: 1805.11006 · v4 · pith:GCSFFLBCnew · submitted 2018-05-28 · 💻 cs.PL

Typed Embedding of a Relational Language in OCaml

Dmitrii Kosarev (Saint Petersburg State University) , Dmitry Boulytchev (Saint Petersburg State University) This is my paper
classification 💻 cs.PL
keywords relationallanguageocamlprogrammingtypedadditionaddressapplications
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Polymorphic Bottom-Up Weighted Relational Programming

    cs.PL 2026-05 unverdicted novelty 6.0

    Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.