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.
55 lines
1.2 KiB
Plaintext
55 lines
1.2 KiB
Plaintext
;; lib/minikanren/tests/btree-walko.sx — walk a leaves-of-binary-tree relation
|
|
;; using matche dispatch on (:leaf v) and (:node left right) patterns.
|
|
|
|
(define
|
|
btree-walko
|
|
(fn
|
|
(tree v)
|
|
(matche
|
|
tree
|
|
((:leaf x) (== v x))
|
|
((:node l r) (conde ((btree-walko l v)) ((btree-walko r v)))))))
|
|
|
|
;; A small test tree: ((1 2) (3 (4 5))).
|
|
(define
|
|
test-btree
|
|
(list
|
|
:node (list :node (list :leaf 1) (list :leaf 2))
|
|
(list
|
|
:node (list :leaf 3)
|
|
(list :node (list :leaf 4) (list :leaf 5)))))
|
|
|
|
(mk-test
|
|
"btree-walko-enumerates-all-leaves"
|
|
(let
|
|
((leaves (run* q (btree-walko test-btree q))))
|
|
(and
|
|
(= (len leaves) 5)
|
|
(and
|
|
(some (fn (l) (= l 1)) leaves)
|
|
(and
|
|
(some (fn (l) (= l 2)) leaves)
|
|
(and
|
|
(some (fn (l) (= l 3)) leaves)
|
|
(and
|
|
(some (fn (l) (= l 4)) leaves)
|
|
(some (fn (l) (= l 5)) leaves)))))))
|
|
true)
|
|
|
|
(mk-test
|
|
"btree-walko-find-3-membership"
|
|
(run 1 q (btree-walko test-btree 3))
|
|
(list (make-symbol "_.0")))
|
|
|
|
(mk-test
|
|
"btree-walko-find-99-not-present"
|
|
(run* q (btree-walko test-btree 99))
|
|
(list))
|
|
|
|
(mk-test
|
|
"btree-walko-leaf-only"
|
|
(run* q (btree-walko (list :leaf 42) q))
|
|
(list 42))
|
|
|
|
(mk-tests-run!)
|