[2607.25373] Towards Bottom-Up Enumeration in miniKanren via Pruning and Memoization

Skip to main content

Search arXiv

Press Enter to search · Advanced search

-->

Computer Science > Programming Languages

arXiv:2607.25373 (cs)

[Submitted on 28 Jul 2026]

Title:Towards Bottom-Up Enumeration in miniKanren via Pruning and Memoization

Authors:Nikolai Kudasov<br>View a PDF of the paper titled Towards Bottom-Up Enumeration in miniKanren via Pruning and Memoization, by Nikolai Kudasov

View PDF<br>HTML (experimental)

Abstract:We present two small library combinators on top of plain miniKanren, designed to bring bottom-up enumeration with observational deduplication, the standard tool in non-relational program-by-example (PBE) synthesizers, into the relational setting. The first combinator, prune, deduplicates an answer stream by a user-supplied key, typically the input/output behavior of the candidate. The second, defrel/bank, memoizes a relation against canonical fresh variables so that a single pruned answer stream is built bottom-up and replayed at every call site. We also discuss a weighted variant, defrel/bank-w, which attaches admissible upper bounds to immature streams to recover best-first enumeration in cases where the natural depth-first canonical order misses compact representatives. On a preliminary PBE benchmark of arithmetic and string synthesis targets, defrel/bank substantially outperforms the depth-bounded baseline on most deep targets, while losing on a small family where the canonical depth-first enumeration order misses compact representatives. We leave a broader empirical evaluation to an extended version of this paper.

Comments:<br>18 pages, plus appendices with full source code (60 pages total). Camera-ready for the miniKanren and Relational Programming Workshop 2026 (miniKanren'26)

Subjects:

Programming Languages (cs.PL); Logic in Computer Science (cs.LO)

Cite as:<br>arXiv:2607.25373 [cs.PL]

(or<br>arXiv:2607.25373v1 [cs.PL] for this version)

https://doi.org/10.48550/arXiv.2607.25373

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Nikolai Kudasov [view email]<br>[v1]<br>Tue, 28 Jul 2026 07:28:51 UTC (94 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Towards Bottom-Up Enumeration in miniKanren via Pruning and Memoization, by Nikolai Kudasov<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.PL

next >

new<br>recent<br>| 2026-07

Change to browse by:

cs<br>cs.LO

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

Major funding support from