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
We discuss the influences of structural proof theory on logic programming and vice versa. Attachments Abstract Dale Miller (87 kB)
We present an extension of our prior work on certified semantics for core miniKanren, introducing disequality constraints in the language. Semantics is […]
We report on ongoing work on introducing a mechanism for private types in a higher-order logic programming language such as λProlog. Attachments […]
We present an approach to pattern matching code generation based on application of relational programming and, in particular, relational interpreters. Attachments Abstract […]