12 citations · 15 across the 5 of their papers we have counts for
6 papers
Efficient Rational Unification for miniKanren
Eridan Domoratskiy, Dmitry Boulytchev
We present an efficient algorithm for rational term unification in persistent settings which demonstrates a comparable performance w.r.t. the conventional miniKanren unification wi…
Reimplementing the Wheel: Teaching Compilers with a Small Self-Contained One
Daniil Berezun, Dmitry Boulytchev
We report on a one-semester compiler construction course based on the idea of implementing a small self-contained compiler for a small model language from scratch, not using other…
An Empirical Study of Partial Deduction for miniKanren
Ekaterina Verbitskaia, Daniil Berezun, Dmitry Boulytchev
We study conjunctive partial deduction, an advanced specialization technique aimed at improving the performance of logic programs, in the context of relational programming language…
Generic Programming with Combinators and Objects
Dmitrii Kosarev, Dmitry Boulytchev
We present a generic programming framework for OCAML which makes it possible to implement extensible transformations for a large scale of type definitions. Our framework makes use…
Typed Embedding of a Relational Language in OCaml
Dmitrii Kosarev, Dmitry Boulytchev
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 polymorph…
Code Reuse With Transformation Objects
Dmitri Boulytchev
We present an approach for a lightweight datatype-generic programming in Objective Caml programming language aimed at better code reuse. We show, that a large class of transformati…