miniKanren and Relational Programming Workshop 2025
2025-10-17
Singapore, Singapore
who it's for
miniKanren implementors, programming language designers, programming language researchers, constraint programming researchers, functional programmers (Haskell), concurrent runtime engineers, database and graph-query engineers, tooling and visualization developers
topics
typed tagless-final embedding; implicit generator passing; functional-conversion backend; semiring arrays evaluation; SAT-backed relation solving; bottom-up fixpoint evaluation; goroutine-per-node actor model; worker-pool parallel search; deterministic small-step semantics; web-based search visualizer; first-class set constraints; rational-tree unification
| title | author | length |
|---|---|---|
| Typed Embedding of miniKanren for Functional Conversion | Igor Engel, Ekaterina Verbitskaia | 23m |
A typed tagless-final embedding of miniKanren into Haskell replaces the old untyped deep AST with generated logic-term types (via Template Haskell), enabling… | ||
| Committing to the bit: Relational programming with semiring arrays and SAT solving | Dmitri Volkov, Yafei Yang, Chung-chieh Shan | 26m |
SemiringKanren implements relations as multi-dimensional semiring arrays evaluated with a bottom-up fixpoint strategy, compiles algebraic types to bitstring… | ||
| concurrentKanren: miniKanren for parallel execution | Sjoerd Dost | 27m |
concurrentKanren implements miniKanren in Golang and runs the search tree as actors, with a naive goroutine-per-node messagebased model that collapses under… | ||
| Visualizing miniKanren Search with a Fine-Grained Small-Step Semantics | Brysen Pfingsten, Jason Hemann | 25m |
Presents a deterministic small-step semantics that models miniKanren’s interleaving at goal-level granularity using delay/go control, left/right disjunctions… | ||
| Frontiers: What's next for miniKanren and Relational Programming? | Jason Hemann | 34m |
miniKanren shows concrete momentum: 11 papers at ICFP-level workshops, many tiny EDSL implementations across host languages, and interoperable ports rather… | ||
| Beyond Cons: Purely Relational Data Structures | Rafaello Sanna, William E. Byrd, Nada Amin | 25m |
Adds a constraint-enabled extension to miniKanren that implements first-class set objects and association-list constraints, giving membership, set… | ||
| Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity(…) | Xiangyu Guo, Ajay Bansal | 27m |
stableKanren implements integrity constraints plus a numeric constraint store to avoid grounding all numbers and encode arithmetic as verifiers, not impure… | ||
| Fair intersection of seekable iterators | Michael Arntzenius | 33m |
Proposes a compositional join implementation based on a seekable iterator interface that bounds work by interleaving calls, introducing a later constructor to… | ||
| An Empirical Study of Rational Tree Unification for miniKanren | Eridan Domoratskiy, Dmitrii Kosarev, Dmitri Boulytchev | 24m |
Implements complete rational‑tree unification inside miniKanren for recursive type inference, replacing substitutions with equation systems instead of… | ||
| Computational Exploration of Finite Semigroupoids | Attila Egri-Nagy, Chrystopher L. Nehaniv | 24m |
Relational programs (miniKanren via core.logic) implement a package called Ken that enumerates finite semigroupoids as partial composition tables, constructs… | ||
| nothing matches | ||