Write a Blog >>
ICFP 2019
Sun 18 - Fri 23 August 2019 Berlin, Germany
Thu 22 Aug 2019 15:55 - 16:30 at Elk - Session 4 Chair(s): Dmitri Boulytchev

We describe fairness levels in disjunction and conjunction implementations. Specifically, a disjunction implementation can be fair, almost-fair, or unfair. And a conjunction implementation can be fair or unfair. We compare the fairness level of four search strategies: the standard miniKanren interleaving depth-first search, the balanced interleaving depth-first search, the fair depth-first search, and the standard breadth-first search. The two non-standard depth-first searches are new. And we present a new, more efficient and shorter implementation of the standard breadth-first search. Using quantitative evaluation, we argue that each depth-first search is a competitive alternative to the standard one, and that our improved breadth-first search implementation is more efficient than the current one.

Thu 22 Aug

minikanren-2019-papers
15:20 - 16:30: miniKanren 2019 - Session 4 at Elk
Chair(s): Dmitri Boulytchev
minikanren-2019-papers15:20 - 15:55
Full-paper
Gregory Rosenblatt, Lisa ZhangUniversity of Toronto, William E. ByrdUniversity of Alabama at Birmingham, USA, Matthew MightUniversity of Alabama at Birmingham | Harvard Medical School
Link to publication
minikanren-2019-papers15:55 - 16:30
Full-paper
Kuang-Chen LuIndiana University, USA, Weixi Ma, Daniel P. FriedmanIndiana University, USA
Link to publication