Tag
This paper introduces two library combinators, prune and defrel/bank, that bring bottom-up enumeration with observational deduplication to miniKanren relational programming, improving program-by-example synthesis performance.
A blog post discussing evaluation order and nontermination in functional relational query languages like λFS, referencing a paper on finite functional programming presented at FLOPS 2026.