ICFP/SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore

The miniKanren and Relational Programming Workshop is a workshop for the miniKanren family of relational (pure constraint logic programming) languages: miniKanren, microKanren, core.logic, OCanren, Guanxi, etc. The workshop solicits papers and talks on the design, implementation, and application of miniKanren-like languages. A major goal of the workshop is to bring together researchers, implementors, and users from the miniKanren community, and to share expertise and techniques for relational programming. Another goal for the workshop is to push the state of the art of relational programming — for example, by developing new techniques for writing interpreters, type inferencers, theorem provers, abstract interpreters, CAD tools, and other interesting programs as relations, which are capable of being “run backward,” performing synthesis, etc.

Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Fri 17 Oct

Displayed time zone: Perth change

10:00 - 10:30
10:00
30m
Coffee break
Break
Catering

10:30 - 12:15
Extending miniKanren and Relational ProgrammingminiKanren at Peony NW
Chair(s): Ekaterina Verbitskaia JetBrains Research; Constructor University Bremen
10:30
26m
Talk
Beyond Cons: Purely Relational Data Structures
miniKanren
Rafaello Sanna Harvard University, William E. Byrd University of Alabama at Birmingham, Nada Amin Harvard University
Pre-print
10:56
26m
Talk
Committing to the bit: Relational programming with semiring arrays and SAT solving
miniKanren
Dmitri Volkov Indiana University, Yafei Yang Indiana University, Chung-chieh Shan Indiana University
DOI Pre-print
11:22
26m
Talk
An Empirical Study of Rational Tree Unification for miniKanren
miniKanren
Eridan Domoratskiy Saint-Petersburg State University, Dmitrii Kosarev , Dmitri Boulytchev Saint Petersburg State University
Pre-print
11:48
26m
Talk
concurrentKanren: miniKanren for parallel execution
miniKanren
Pre-print
12:15 - 13:45
12:15
90m
Lunch
Lunch
Catering

13:45 - 15:30
Relational conversion, compilation, and encodingminiKanren at Peony NW
Chair(s): Jason Hemann Seton Hall University
13:45
13m
Talk
Designing Walrus: Relational Programming with Rich Types, On-Demand Laziness, and Structured Traces
miniKanren
Santiago Cuellar Galois, Inc, Naomi Spargo Galois, Inc., Jonathan Daugherty Galois, Inc., David Darais Galois
Pre-print
13:58
13m
Talk
The CoCompiler: DSL Lifting via Relational Compilation
miniKanren
Naomi Spargo Galois, Inc., Santiago Cuellar Galois, Inc, Jonathan Daugherty Galois, Inc., Chris Phifer Galois, David Darais Galois
Pre-print
14:11
26m
Talk
Typed Embedding of miniKanren for Functional Conversion
miniKanren
Igor Engel JetBrains Research; Constructor University Bremen, Ekaterina Verbitskaia JetBrains Research; Constructor University Bremen
Pre-print
14:37
26m
Talk
Fair intersection of seekable iterators
miniKanren
Michael Arntzenius UC Berkeley
Pre-print
15:03
26m
Talk
Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity Constraints in stableKanren
miniKanren
Xiangyu Guo Arizona State University, Ajay Bansal Arizona State University
Pre-print
15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

16:00 - 17:30
Explorations in miniKanren and Relational Programming & Panel/DiscussionminiKanren at Peony NW
Chair(s): Dmitri Boulytchev Saint Petersburg State University
16:00
26m
Talk
Computational Exploration of Finite SemigroupoidsRemote
miniKanren
Attila Egri-Nagy Akita International University, Chrystopher L. Nehaniv University of Waterloo
Pre-print
16:26
26m
Talk
Visualizing miniKanren Search with a Fine-Grained Small-Step Semantics
miniKanren
Brysen Pfingsten Seton Hall University, Jason Hemann Seton Hall University
Pre-print
16:52
38m
Panel
Frontiers: What's next for miniKanren and Relational Programming?
miniKanren
Jason Hemann Seton Hall University

Call for Papers

The 2025 miniKanren and Relational Programming Workshop is calling for submissions.

Submissions are due Thursday 10 July 2025. Sunday 20 July 2025.

Authors will be notified by Tuesday, 12 August 2025. Friday, 22 August 2025.

Camera-ready versions are due Monday, 25 August 2025. Thursday, 4 September 2025.

The workshop will be held in Singapore on Friday, 17 October 2025.

All deadlines are (23:59 UTC-12), “Anywhere on Earth”.

The miniKanren and Relational Programming Workshop is a workshop for the miniKanren family of relational (pure constraint logic programming) languages: miniKanren, microKanren, core.logic, OCanren, Guanxi, etc. The workshop solicits papers and talks on the design, implementation, and application of miniKanren-like languages. A major goal of the workshop is to bring together researchers, implementors, and users from the miniKanren community, and to share expertise and techniques for relational programming. Another goal for the workshop is to push the state of the art of relational programming — for example, by developing new techniques for writing interpreters, type inferencers, theorem provers, abstract interpreters, CAD tools, and other interesting programs as relations, which are capable of being “run backward,” performing synthesis, etc.

We want to encourage all kinds of submissions. We expect short papers as well as longer papers. As a rough guideline, with the new ACM format, a short paper would be 2 to 7 pages and a long paper 8 to 25 pages. Submission Information

Paper submissions must use the format acmart and its sub-format acmsmall. Here is the preamble in LaTeX: \documentclass[acmsmall,screen,review,anonymous]{acmart}

Authors are encouraged to publish any code associated with their papers under an open-source license, so that reviewers may try the code and verify the claims.

Submissions must be anonymized and should not contain any identifying information. It is recommended to use the review option when submitting a paper; this option enables line numbers for easy reference in reviews.

Reviewing Process

We will use lightweight-double-blind reviewing. Submitted papers must omit author names and institutions and reference the authors’ own related work in the third person (e.g., not “we build on our previous work…” but rather “we build on the work of…”).

The purpose is to help the reviewers come to an initial judgement about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult (e.g., important background references should not be omitted or anonymized).

Proceedings will be published on https://arxiv.org/.

Publication of a paper at this workshop is not intended to replace conference or journal publication and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal.

Please submit through the miniKanren Workshop HotCRP site: https://minikanren25.hotcrp.com/

Participant Support

Attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page.

Questions? Use the miniKanren contact form.