miniKanren: a minimal declarative language for relational programming

" summary

Introduces miniKanren, an embedded domain-specific language for constraint logic programming that enables relational programming where code is relations without fixed inputs or outputs. Describes how miniKanren combines unification and other constraints with a complete interleaving search to solve for unknown variables, framing queries as program-synthesis problems.

AI-written summary · about

" related talks

• 40mminiKanren PhilosophyDaniel Friedman, William E. Byrd · Clojure/conj 2012
• 20mKanren LightMaggesi, Nocentini · miniKanren 2020
• 17mλKanren: Higher-order Logic Programming with Shallow EmbeddingWeixi Ma · miniKanren 2020
• 26mtypedKanren: Statically Typed Relational Programming with Exhaustive Matching in(…)Nikolai Kudasov, Artem Starikov · Haskell 2025
• 16mMulti-stage Relational ProgrammingNada Amin, Jason Hemann, William E. Byrd, Michael Ballantyne, Rafaello Sanna · PLDI 2025
• 19mSome Novel miniKanren Synthesis TasksHemann, Friedman · miniKanren 2020
• 26mCommitting to the bit: Relational programming with semiring arrays and SAT solvingChung-chieh Shan, Dmitri Volkov, Yafei Yang · miniKanren and Relational Programming Workshop 2025
• 22mA Case Study in Functional Conversion and Mode Inference in miniKanrenEkaterina Verbitskaia, Igor Engel, Daniil Berezun · PEPM 2024