Efficient Fair Conjunction for Structurally-Recursive Relations
We present a new, fair, conjunction evaluation strategy for relational programming language miniKanren. Unlike the original left-biased conjunction, our approach controls the order of conjunct execution based on the intrinsic properties of relation definitions. We present both the formal study of conjunction fairness and practical evaluation, which demonstrates the essential improvement in terms of both performance and convergence.
Mon 18 Jan Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
13:30 - 14:30
|Control Flow Obfuscation for Featherweight Java using Continuation Passing|
Kenny Zhuo Ming LuISTD, Singapore University of Technology and DesignMedia Attached File Attached
|Efficient Fair Conjunction for Structurally-Recursive Relations|
Petr LozovSain Petersburg State University, SPbGU, Dmitri BoulytchevSaint Petersburg State University / JetBrains ResearchMedia Attached File Attached