(Please note that the deadline has been extended!) DEADLINE (*extended*): 27 May 2019, (Any time in the world) WEBSITE: https://icfp19.sigplan.org/home/minikanren-2019 LOCATION: Berlin, Germany (co-located with ICFP) DATE: 22 August 2019
The 2019 First miniKanren and Relational Programming Workshop is calling for submissions. Full papers are due 27 May 2019. Authors will be notified by 15 June 2019. Camera-ready versions are due 30 June 2019. All deadlines are (23:59 UTC-12), "Anywhere on Earth". 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. Sincerely, William E. Byrd, General Chair Nada Amin, Program Committee Chair Program Committee: Claire Alvis, Sparkfund Tom Gilray, University of Alabama, Birmingham Jason Hemann, Northeastern University Eric Holk, Google Kanae Tsushima, National Institute of Informatics -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/a3287794-b881-40b5-8205-fac3f3d53b04%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
