Hey, folks I'm experimenting with the search order in out OCanren [1] to make it more similar to the one on faster-miniKanren. I kind of managed to do it but an a la quine demo for stlc has started to diverge. I rewritten our implementation to miniKanren and it still diverges [2]. Do we have a canonical implementation for lambda calculus somewhere? (I have found only for scheme-like language) I want to compare the code.....
Happy hacking, Dmitrii a.k.a. Kakadu [1] https://github.com/kakadu/ocanren/tree/dumb-streams [2] https://gist.github.com/Kakadu/65cc739ab21ef6f42319aa7ba78166db -- 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.
