An Empirical Study of Partial Deduction for miniKanren

09/07/2021
by   Ekaterina Verbitskaia, et al.
0

We study conjunctive partial deduction, an advanced specialization technique aimed at improving the performance of logic programs, in the context of relational programming language miniKanren. We identify a number of issues, caused by miniKanren peculiarities, and describe a novel approach to specialization based on partial deduction and supercompilation. The results of the evaluation demonstrate successful specialization of relational interpreters. Although the project is at an early stage, we consider it as the first step towards an efficient optimization framework for miniKanren.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2018

Typed Embedding of a Relational Language in OCaml

We present an implementation of the relational programming language mini...
research
05/03/2020

Certified Semantics for Relational Programming

We present a formal study of semantics for the relational programming la...
research
02/12/2002

Logic program specialisation through partial deduction: Control issues

Program specialisation aims at improving the overall performance of prog...
research
05/17/2012

kLog: A Language for Logical and Relational Learning with Kernels

We introduce kLog, a novel approach to statistical relational learning. ...
research
03/04/2020

Language-Integrated Updatable Views (Extended version)

Relational lenses are a modern approach to the view update problem in re...
research
02/22/2019

Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics

We give a language-parametric solution to the problem of total correctne...

Please sign up or login with your details

Forgot password? Click here to reset