Advanced implementations – Workshop on Trends, Extensions, Applications and Semantics of Logic Programming https://www.coalg.org/tease-lp TEASE-LP, 28 and 29 May 2020, Virtual Event Wed, 27 May 2020 21:03:53 +0000 en-GB hourly 1 https://wordpress.org/?v=6.1.1 Robert Zinkov, Michael Ballantyne, Gregory L. Rosenblatt and William E. Byrd: Accelerating Program Synthesis in miniKanren https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/ https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/#respond Thu, 14 May 2020 12:42:11 +0000 https://www.coalg.org/tease-lp/?p=117 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.


Forum    Video    Full Abstract

]]> https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/feed/ 0 Marco Maggesi and Enrico Tassi: Private types in Higher Order Logic Programming https://www.coalg.org/tease-lp/2020/private-types-in-higher-order-logic-programming/ https://www.coalg.org/tease-lp/2020/private-types-in-higher-order-logic-programming/#respond Thu, 14 May 2020 12:40:51 +0000 https://www.coalg.org/tease-lp/?p=115 We report on ongoing work on introducing a mechanism for private types in a higher-order logic programming language such as λProlog.

Forum    Full Abstract

]]> https://www.coalg.org/tease-lp/2020/private-types-in-higher-order-logic-programming/feed/ 0 Maria Kuklina and Ekaterina Verbitskaia: Supercompilation Strategies of Relational Programs https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/ https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/#respond Thu, 14 May 2020 12:31:08 +0000 https://www.coalg.org/tease-lp/?p=104 In this paper we research methods of supercompilation in the context of relational program specialization. We implement a supercompiler for miniKanren with different unfolding strategies and compare them.

Forum Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/feed/ 0 Ekaterina Verbitskaia, Irina Artemeva and Daniil Berezun: Binding-Time Analysis for miniKanren https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/ https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/#respond Thu, 14 May 2020 12:29:05 +0000 https://www.coalg.org/tease-lp/?p=100 We present a binding-time analysis algorithm for miniKanren. It is capable to determine the order in which names within a program are bound and can be used to facilitate specialization and as a step of conversion into a functional language.

Forum Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/feed/ 0