#paper #toread on "Rel", which aspires to “fully describe end to end application semantics” in relational terms. How does this relate to #Kanren?
on 02025-12-26natecull of the Malleable Systems Collective: “can we take the Logic Programming model as in #Prolog or #Kanren, and remove the concept of “logic variable” from it, ending up with a fully point-free logic programming?” He was excited to find #Binate. #logic-programming #binary-relations
on 02024-01-28Matt Might was writing about an even smaller #KANREN than μKanren but hasn’t built it yet
on 02021-09-17#audio #interview with William Byrd about #KANREN, with a transcript. Kind of insane that in 2013 he was still a postdoc; maybe he still is today?
on 02017-02-23The original #KANREN homepage: “KANREN is a declarative logic programming system with first-class relations, embedded in a pure functional subset of Scheme. The system has a set-theoretical semantics, true unions, fair scheduling, first-class relations, lexically-scoped logical variables, depth-first and iterative deepening strategies. The system achieves high performance and expressivity without cuts.” #logic-programming #formal-methods
on 02016-11-21Discussion thread on Will Byrd’s program #editor "Barliman", which uses #miniKanren to search for simple #Scheme programs that pass a given test suite. #KANREN
on 02016-08-01#miniKanren extended with #constraint-programming and ported to Bigloo. Unfortunately it seems to be totally undocumented beyond the build instructions and a list of operators. #KANREN
on 02015-09-18#introduction to core.logic, the implementation of #miniKanren #logic-programming that’s in the #Clojure standard library. This has the major advantage over the other introductions I’ve found that it starts with explaining the usage of miniKanren, rather than the implementation. #KANREN
on 02015-09-16a talk presenting a Ruby version of μKanren. #logic-programming #Kanren
on 02015-09-16the μKanren #paper, presenting a tiny version of the #logic-programming language #Kanren in 39 lines of Scheme, in 8 pages. Unfortunately, those 8 pages say things like “mapping tuples of domain elements into a linearized submultiset of elements of the codomain over which the initial relation holds.”.
on 02015-09-16comparing the #miniKanren #logic-programming language (a version of #Kanren) to #Prolog.
on 02015-09-06the #miniKanren #logic-programming EDSL in a web-based #Scheme interpreter, interspersed with an explanation. #KANREN
on 02015-09-06