giles
57a84b372d
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 57s
Squash merge of 76 commits from loops/minikanren. Adds lib/minikanren/ — a complete miniKanren-on-SX implementation built on top of lib/guest/match.sx, validating the lib-guest unify-and-match kit as intended. Modules (20 .sx files, ~1700 LOC): unify, stream, goals, fresh, conde, condu, conda, run, relations, peano, intarith, project, nafc, matche, fd, queens, defrel, clpfd, tabling Phases 1–5 fully done (core miniKanren API, all classic relations, matche, conda, project, nafc). Phase 6 — native CLP(FD): domain primitives, fd-in / fd-eq / fd-neq / fd-lt / fd-lte / fd-plus / fd-times / fd-distinct / fd-label, with constraint reactivation iterating to fixed point. N-queens via FD: 4-queens 2 solutions, 5-queens 10 solutions (vs naive timeout past N=4). Phase 7 — naive ground-arg tabling: table-1 / table-2 / table-3. Fibonacci canary: tab-fib(25) = 75025 in seconds, naive fib(25) times out at 60s. Ackermann via table-3: A(3,3) = 61. 71 test files, 644+ tests passing across the suite. Producer/consumer SLG (cyclic patho, mutual recursion) deferred — research-grade work. The lib-guest validation experiment is conclusive: lib/minikanren/ unify.sx adds ~50 lines of local logic (custom cfg, deep walk*, fresh counter) over lib/guest/match.sx's ~100-line kit. The kit earns its keep ~3× by line count.
49 lines
1.2 KiB
Plaintext
49 lines
1.2 KiB
Plaintext
;; lib/minikanren/tests/cyclic-graph.sx — demonstrates the naive-patho
|
|
;; behaviour on a cyclic graph. Without Phase-7 tabling/SLG, the search
|
|
;; produces ever-longer paths revisiting the cycle. `run n` truncates;
|
|
;; `run*` would diverge.
|
|
|
|
(define cyclic-edges (list (list :a :b) (list :b :a) (list :b :c)))
|
|
|
|
(define cyclic-edgeo (fn (x y) (membero (list x y) cyclic-edges)))
|
|
|
|
(define
|
|
cyclic-patho
|
|
(fn
|
|
(x y path)
|
|
(conde
|
|
((cyclic-edgeo x y) (== path (list x y)))
|
|
((fresh (z mid) (cyclic-edgeo x z) (cyclic-patho z y mid) (conso x mid path))))))
|
|
|
|
;; --- direct edge ---
|
|
|
|
(mk-test
|
|
"cyclic-direct"
|
|
(run 1 q (cyclic-patho :a :b q))
|
|
(list (list :a :b)))
|
|
|
|
;; --- runs first 5 paths from a to b: bare edge, then increasing
|
|
;; numbers of cycle traversals (a->b->a->b, etc.) ---
|
|
|
|
(mk-test
|
|
"cyclic-enumerates-prefix-via-run-n"
|
|
(let
|
|
((paths (run 5 q (cyclic-patho :a :b q))))
|
|
(and
|
|
(= (len paths) 5)
|
|
(and
|
|
(every? (fn (p) (= (first p) :a)) paths)
|
|
(every? (fn (p) (= (last p) :b)) paths))))
|
|
true)
|
|
|
|
(mk-test
|
|
"cyclic-finds-c-via-cycle-or-direct"
|
|
(let
|
|
((paths (run 3 q (cyclic-patho :a :c q))))
|
|
(and
|
|
(>= (len paths) 1)
|
|
(some (fn (p) (= p (list :a :b :c))) paths)))
|
|
true)
|
|
|
|
(mk-tests-run!)
|