The miniKanren and Relational Programming Workshop is a new 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.
Talks will be virtual on Airmeet. All talks will be streamed in real-time at M3 audience.
Thu 15 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
08:00 - 09:00 | |||
08:00 60mRegistration | Registration Catering & social |
09:00 - 10:30 | |||
09:00 30mTalk | On a Declarative Guideline-Directed UI Layout SynthesisVirtual, Live miniKanren Dmitrii Kosarev Saint Petersburg State University, P: Petr Lozov St. Petersburg State University, St. Petersburg, Russia, Denis Fokin , Dmitri Boulytchev St. Petersburg State University, St. Petersburg, Russia Pre-print File Attached | ||
09:30 30mTalk | On a Direction-Driven Functional ConversionVirtual, Live miniKanren P: Ekaterina Verbitskaia JetBrains, Daniil Berezun JetBrains Research, Dmitri Boulytchev St. Petersburg State University, St. Petersburg, Russia Pre-print File Attached | ||
10:00 30mTalk | Wildcard Logic VariablesVirtual, Live miniKanren P: Dmitrii Kosarev Saint Petersburg State University, Daniil Berezun JetBrains Research, Petr Lozov St. Petersburg State University, St. Petersburg, Russia Pre-print File Attached |
10:30 - 11:00 | |||
10:30 30mCoffee break | Coffee break Catering & social |
11:00 - 12:30 | |||
11:00 30mTalk | A Tutorial Reconstruction of miniKanren with constraintsVirtual Tutorial miniKanren Pre-print File Attached | ||
11:30 60mTutorial | Relational Interpreters, Conversion, and SynthesisVirtual Live Tutorial miniKanren File Attached |
12:30 - 14:00 | |||
12:30 90mLunch | Lunch Catering & social |
14:00 - 15:30 | |||
14:00 30mTalk | Efficient Variational Inference in miniKanren with Weighted Model CountingVirtual, Live miniKanren Pre-print File Attached | ||
14:30 30mTalk | Some criteria for implementations of conjunction and disjunction in microKanrenVirtual, Live miniKanren Pre-print | ||
15:00 30mTalk | Fail Fast and Profile On: Towards a miniKanren ProfilerVirtual, Live miniKanren P: Sloan Chochinov University of Toronto Mississauga, P: Daksh Malhotra University of Toronto Mississauga, Gregory Rosenblatt University of Alabama at Birmingham, Matthew Might University of Alabama at Birmingham | Harvard Medical School, Lisa Zhang University of Toronto Mississauga Pre-print |
15:30 - 16:00 | |||
15:30 30mCoffee break | Coffee break Catering & social |
Accepted Papers
Call for Papers
The miniKanren and Relational Programming Workshop is a new 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 “sigplan”. They must be in PDF, printable in black and white on US Letter size. Microsoft Word and LaTeX templates for this format are available at:
http://www.sigplan.org/Resources/Author/
This format is in line with ACM conferences (such as ICFP with which we are colocated).
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 as a Technical Report at Harvard University.
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.