* README.md: add note on fair conjunction

senior · Nov 20, 2011 · ab99ec9 · ab99ec9
1 parent b47c860
commit ab99ec9
Showing 1 changed file with 1 addition and 0 deletions.
diff --git a/README.md b/README.md
@@ -19,6 +19,7 @@ Immediate Roadmap
 
 The following are avenues we are interesting in pursuing now:
 
+* **Fair Conjunction** - currently many finite programs diverge if recursive goals are not carefully ordered. Some work has been done towards guaranteeing termination. Do these changes adversely affect the performance of many useful programs? Is this a non-concern with constraint programming facilities?
 * **Environment Trimming** - Definite Clause Grammars (DCGs) are quite slow in miniKanren. This may be due to a lack of groundness analysis or it may be because we are not trimming the environment of needless logic variables. It looks like the original Kanren paper may have some good approaches.
 * **Constraint Logic Programming** - Constraint Handling Rules (CHR) is particularly inspiring. William Byrd and Daniel Friedman are working on CLP(FD) and CLP(X) extensions to miniKanren. We should incorporate this.
 * **Groundness Analysis** - Initial research on feasibility done. It does in fact give significant performance boosts (2-3X). Seems to close many performance gaps between SWI-Prolog and miniKanren. However maintaining correctness seems difficult. Perhaps limit optimization to DCGs and pattern matching sugar. Again, the original Kanren paper may have insights here.