An Empirical Study of Partial Deduction for miniKanren

Ekaterina Verbitskaia
(JetBrains Research)
Daniil Berezun
(SPbSU, JetBrains Research)
Dmitry Boulytchev
(SPbSU, JetBrains Research)

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.

In Alexei Lisitsa and Andrei P. Nemytykh: Proceedings of the 9th International Workshop on Verification and Program Transformation (VPT 2021), Luxembourg, Luxembourg, 27th and 28th of March 2021, Electronic Proceedings in Theoretical Computer Science 341, pp. 73–94.
Published: 6th September 2021.

ArXived at: https://dx.doi.org/10.4204/EPTCS.341.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org