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.
Morning and Afternoon Keynotes
Title | |
---|---|
Adventures in extending miniKanren miniKanren Media Attached | |
Relational Content Generation miniKanren Media Attached |
Thu 26 AugDisplayed time zone: Seoul change
20:00 - 21:30 | Session AminiKanren at miniKanren Chair(s): William E. Byrd University of Alabama at Birmingham, USA | ||
20:00 5mDay opening | Opening Remarks miniKanren | ||
20:05 30mPaper | A Complexity Study for Interleaving Search miniKanren Pre-print Media Attached | ||
20:35 30mPaper | metaKanren: Towards a Metacircular Relational Interpreter miniKanren Pre-print Media Attached | ||
21:05 25mPaper | A New Higher-order Unification Algorithm for λKanren miniKanren Pre-print Media Attached |
22:00 - 23:30 | |||
22:00 60mKeynote | Adventures in extending miniKanren miniKanren Nada Amin Harvard University Media Attached |
23:30 - 01:00 | |||
23:30 30mPaper | Prolog-Style Meta-Programming miniKanren miniKanren Nada Amin Harvard University, William E. Byrd University of Alabama at Birmingham, USA, Tiark Rompf Purdue University Pre-print Media Attached | ||
00:00 30mPaper | Guarded Fresh Goals: Dependency-Directed Introduction of Fresh Logic Variables miniKanren Evan Donahue University of Tokyo Pre-print Media Attached | ||
00:30 30mPaper | Universal Quantification and Implication in miniKanren miniKanren Ende Jin , Gregory Rosenblatt University of Alabama at Birmingham, USA, Matthew Might University of Alabama at Birmingham | Harvard Medical School, Lisa Zhang University of Toronto Mississauga Pre-print Media Attached |
Fri 27 AugDisplayed time zone: Seoul change
01:30 - 03:00 | Afternoon Keynote and Session CminiKanren at miniKanren Chair(s): Gregory Rosenblatt University of Alabama at Birmingham, USA | ||
01:30 60mKeynote | Relational Content Generation miniKanren Chris Martens North Carolina State University Media Attached | ||
02:30 25mPaper | Relational Floating-Point Arithmetic miniKanren Lucas Sandre University of Toronto Mississauga, Malaika Zaidi University of Toronto Mississauga, Lisa Zhang University of Toronto Mississauga Pre-print Media Attached | ||
02:55 5mDay closing | Closing Remarks miniKanren |
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” “acmsmall” (note the change from last year). 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 the University of Toronto.
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.