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 backwards,” performing synthesis, etc.
The informal proceedings of the 1st workshop are now available as a Harvard Technical report.
Thu 22 AugDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:00 - 10:00 | |||
09:00 60mTutorial | Tutorial on miniKanren miniKanren William E. Byrd University of Alabama at Birmingham, USA |
10:30 - 12:00 | |||
10:30 45mFull-paper | Relational Interpreters for Search Problems miniKanren Petr Lozov Sain Petersburg State University, SPbGU, Ekaterina Verbitskaia Saint Petersburg State University, Russia, Dmitri Boulytchev Link to publication | ||
11:15 45mFull-paper | Relational Processing for Fun and Diversity: Simulating a CPU relationally with miniKanren miniKanren Link to publication |
12:00 - 13:30 | |||
13:30 - 15:00 | |||
13:30 45mFull-paper | Certified Semantics for miniKanren miniKanren Link to publication | ||
14:15 45mFull-paper | Constructive Negation for miniKanren miniKanren Link to publication |
15:20 - 16:30 | |||
15:20 35mFull-paper | First-order miniKanren representation: Great for tooling and search miniKanren Gregory Rosenblatt , Lisa Zhang University of Toronto, William E. Byrd University of Alabama at Birmingham, USA, Matthew Might University of Alabama at Birmingham | Harvard Medical School Link to publication | ||
15:55 35mFull-paper | Towards a miniKanren with fair search strategies miniKanren Link to publication |
16:50 - 18:15 | |||
16:50 85mSocial Event | Q&A with audience miniKanren |
18:15 - 20:15 | |||
18:15 2hSocial Event | Industrial Reception Catering |
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 backwards,” performing synthesis, etc.
Submission Information
Submission Page: https://minikanren19.hotcrp.com/
Paper submissions must use the format acmart and its sub-format acmlarge. 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/
As this is the first iteration of the workshop, 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.
Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims.
Proceedings will be printed 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.