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 problem of cut elimination in an intuitionistic version of Church’s Type Theory with constraints, a problem that arises in […]
In this paper we research methods of supercompilation in the context of relational program specialization. We implement a supercompiler for miniKanren with […]
We report on ongoing work on introducing a mechanism for private types in a higher-order logic programming language such as λProlog. Attachments […]
Runtime verification (RV) consists in dynamically checking event traces generated by single runs of a system against a formal specification; such a […]