3 papers
cs.LO2026
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…
cs.LO2025
An Empirical Study of Rational Tree Unification for miniKanren
Eridan Domoratskiy, Dmitrii Kosarev, Dmitry Boulytchev
We present a study of unification for rational trees in the context of miniKanren. We give the definition of rational trees, specify the unification algorithm and prove some of its…
cs.PL2024
A Relational Solver for Constraint-based Type Inference
Eridan Domoratskiy, Dmitry Boulytchev
We present a miniKanren-based type inferencer for an educational programming language with first-class functions, S-expressions, and pattern-matching. The language itself is untype…