Hi everybody ! I am curious about memoization in MiniKanren. I've read the corresponding chapter in W.Byrd thesis. But it's seems like the proposed solution is very restrictive, e.g. disequality constraints isn't handled.
I am very interesting in tabling since I am writing a relational interpreter of some imperative language. The tabling helps a lot both with convergence and with running time. However, currently I use disequality constraints in several places. I suspect that I get wrong results sometimes because of interaction of tabling and disequality. Is there any way to support constraints with tabling ? -- You received this message because you are subscribed to the Google Groups "minikanren" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/minikanren. For more options, visit https://groups.google.com/d/optout.
