Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse code

* README.md: add note on fair conjunction

  • Loading branch information...
commit ab99ec9470ff3124f92c41c8f3d34b937f2b25f9 1 parent b47c860
David Nolen swannodette authored

Showing 1 changed file with 1 addition and 0 deletions. Show diff stats Hide diff stats

  1. +1 0  README.md
1  README.md
Source Rendered
@@ -19,6 +19,7 @@ Immediate Roadmap
19 19
20 20 The following are avenues we are interesting in pursuing now:
21 21
  22 +* **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?
22 23 * **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.
23 24 * **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.
24 25 * **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.

0 comments on commit ab99ec9

Please sign in to comment.
Something went wrong with that request. Please try again.