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
Internet routing is the process of selecting paths across the Internet to connect the communicating hosts, it is unique in that path […]
We present an extension of our prior work on certified semantics for core miniKanren, introducing disequality constraints in the language. Semantics is […]
In this paper we research methods of supercompilation in the context of relational program specialization. We implement a supercompiler for miniKanren with […]
Type systems are a powerful tool in modern programming languages. We argue that, to be successfully adopted by the logic programming community, […]