POPL 2021 (series) / PEPM 2021 (series) / PEPM 2021 /
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.
Preprint (fair-conj.pdf) | 768KiB |
Mon 18 Jan Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Mon 18 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
13:30 - 14:30: Session 3PEPM at PEPM Chair(s): Robert AtkeyUniversity of Strathclyde Live stream: https://www.youtube.com/watch?v=G5vngBBn398 | |||
13:30 - 14:00 Short-paper | Control Flow Obfuscation for Featherweight Java using Continuation Passing PEPM Kenny Zhuo Ming LuISTD, Singapore University of Technology and Design File Attached | ||
14:00 - 14:30 Research paper | Efficient Fair Conjunction for Structurally-Recursive Relations PEPM Petr LozovSain Petersburg State University, SPbGU, Dmitri BoulytchevSaint Petersburg State University / JetBrains Research File Attached |