While many logic programming systems like miniKanren are highly expressive, they suffer from long and unpredictable running times. The challenge comes from the search algorithm being usually an uninformed search. Through the domain of program synthesis we show that it possible to greatly speedup this search by guiding it using example programs.
You may also like
Forum Slides Attachments TEASE-LP_Sattler (7 MB)
We present an extension of our prior work on certified semantics for core miniKanren, introducing disequality constraints in the language. Semantics is […]
We discuss the influences of structural proof theory on logic programming and vice versa. Attachments Abstract Dale Miller (87 kB)
We present a binding-time analysis algorithm for miniKanren. It is capable to determine the order in which names within a program are […]