Typed Embedding of a Relational Language in OCaml

05/28/2018
by   Dmitry Kosarev, et al.
0

We present an implementation of the relational programming language miniKanren as a set of combi- nators 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 ad- dress the problem of integration of relational subsystems into functional applications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2020

Language-Integrated Updatable Views (Extended version)

Relational lenses are a modern approach to the view update problem in re...
research
09/07/2021

An Empirical Study of Partial Deduction for miniKanren

We study conjunctive partial deduction, an advanced specialization techn...
research
03/28/2023

Ideograph: A Language for Expressing and Manipulating Structured Data

We introduce Ideograph, a language for expressing and manipulating struc...
research
05/03/2020

Certified Semantics for Relational Programming

We present a formal study of semantics for the relational programming la...
research
08/09/2019

Functional programming with lambda-tree syntax

We present the design of a new functional programming language, MLTS, th...
research
01/16/2018

Learning Features For Relational Data

Feature engineering is one of the most important but tedious tasks in da...
research
06/26/2017

Parareal Algorithm Implementation and Simulation in Julia

We present a full implementation of the parareal algorithm---an integrat...

Please sign up or login with your details

Forgot password? Click here to reset