ICFP/SPLASH 2025 (series) / miniKanren 2025 (series) / miniKanren 2025 /
An Empirical Study of Rational Tree Unification for miniKanren
Fri 17 Oct 2025 11:22 - 11:48 at Peony NW - Extending miniKanren and Relational Programming Chair(s): Ekaterina Verbitskaia
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 properties. We also introduce a number of heuristic optimizations and evaluate them for a number of relevant benchmarks. Finally we discuss the relations between rational and conventional unification algorithms and possible scenarios of their coexistence in the context of relational programming.
Fri 17 OctDisplayed time zone: Perth change
Fri 17 Oct
Displayed time zone: Perth change
10:30 - 12:15 | Extending miniKanren and Relational ProgrammingminiKanren at Peony NW Chair(s): Ekaterina Verbitskaia JetBrains Research; Constructor University Bremen | ||
10:30 26mTalk | Beyond Cons: Purely Relational Data Structures miniKanren Rafaello Sanna Harvard University, William E. Byrd University of Alabama at Birmingham, Nada Amin Harvard University Pre-print | ||
10:56 26mTalk | Committing to the bit: Relational programming with semiring arrays and SAT solving miniKanren Dmitri Volkov Indiana University, Yafei Yang Indiana University, Chung-chieh Shan Indiana University DOI Pre-print | ||
11:22 26mTalk | An Empirical Study of Rational Tree Unification for miniKanren miniKanren Eridan Domoratskiy Saint-Petersburg State University, Dmitrii Kosarev , Dmitri Boulytchev Saint Petersburg State University Pre-print | ||
11:48 26mTalk | concurrentKanren: miniKanren for parallel execution miniKanren Sjoerd Dost None Pre-print | ||