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
Evidential transactions (ETs) provide auditable and composable evidence that serves as a witness or a proof that a transaction has been correctly […]
We report on ongoing work on introducing a mechanism for private types in a higher-order logic programming language such as λProlog. Attachments […]
Forum Slides Attachments TEASE-LP_Sattler (7 MB)
Runtime verification (RV) consists in dynamically checking event traces generated by single runs of a system against a formal specification; such a […]