miniKanren is a pure constraint logic programming language designed for relational programming --- that is, every miniKanren program represents a mathematical relation. These relational programs exhibit interesting behavior --- for example, an interpreter written in miniKanren can perform program synthesis "for free." In the talk the fundamentals of miniKanren and relational programming will be briefly described. The new techniques for relational programming, applications enabled by these new techniques, and related open problems will be presented. Topics will include: techniques for speeding up miniKanren-based program synthesis (with Greg Rosenblatt, Michael Ballantyne, Rob Zinkov, Kanae Tsushima); a protoype relational abstract interpreter (with Nada Amin, David Darais, Tom Gilray, Kristopher Micinski); and integration of SMT solvers into miniKanren (with Nada Amin).
Presented: Will Byrd, University of Birmingham, Alabama, USA
Date: October 15, 2018
Venue: room 3248, Faculty of Mathematics and Mechanics, Saint Petersburg State University, Stary Peterhof, Universitetski pr., 28