An Empirical Study of Partial Deduction for miniKanren
Programming Languages
2021-09-08 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2109.02814,
title = {An Empirical Study of Partial Deduction for miniKanren},
author = {Ekaterina Verbitskaia and Daniil Berezun and Dmitry Boulytchev},
journal= {arXiv preprint arXiv:2109.02814},
year = {2021}
}
Comments
In Proceedings VPT 2021, arXiv:2109.02001