An Empirical Study of Rational Tree Unification for miniKanren
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915533583024128 |
|---|---|
| author | Domoratskiy, Eridan Kosarev, Dmitrii Boulytchev, Dmitry |
| author_facet | Domoratskiy, Eridan Kosarev, Dmitrii Boulytchev, Dmitry |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_03789 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Empirical Study of Rational Tree Unification for miniKanren Domoratskiy, Eridan Kosarev, Dmitrii Boulytchev, Dmitry Logic in Computer Science Programming Languages 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. |
| title | An Empirical Study of Rational Tree Unification for miniKanren |
| topic | Logic in Computer Science Programming Languages |
| url | https://arxiv.org/abs/2510.03789 |