One possibly powerful technique for letting us synthesize larger programs would be to use some form of bidirectional search:
https://en.wikipedia.org/wiki/Bidirectional_search By searching "forward" and "backwards" simultaneously, the effective depth of the search can be halved. There are technical issues with implementing such a search, but it could give us a huge payoff. I can imagine a few ways to try to implement bidirectional search (perhaps restricted to the relational interpreter or to Barliman). I'm curious if anyone else has thoughts on how we might implement this search, and what the tradeoffs would be. Thanks! --Will -- 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.
