Files
rose-ash/lib/minikanren/tests/tabling.sx
giles 57a84b372d
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 57s
Merge loops/minikanren into architecture: full miniKanren-on-SX library
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.
2026-05-08 23:01:54 +00:00

61 lines
1.6 KiB
Plaintext

;; lib/minikanren/tests/tabling.sx — Phase 7 piece A: naive memoization.
;; --- Fibonacci canary: tabled vs naive --
(define
tab-fib-o
(table-2
"fib"
(fn
(n result)
(conde
((== n 0) (== result 0))
((== n 1) (== result 1))
((fresh (n-1 n-2 r-1 r-2) (lto-i 1 n) (minuso-i n 1 n-1) (minuso-i n 2 n-2) (tab-fib-o n-1 r-1) (tab-fib-o n-2 r-2) (pluso-i r-1 r-2 result)))))))
(mk-tab-clear!)
(mk-test "tab-fib-zero" (run* q (tab-fib-o 0 q)) (list 0))
(mk-tab-clear!)
(mk-test "tab-fib-one" (run* q (tab-fib-o 1 q)) (list 1))
(mk-tab-clear!)
(mk-test "tab-fib-two" (run* q (tab-fib-o 2 q)) (list 1))
(mk-tab-clear!)
(mk-test "tab-fib-five" (run* q (tab-fib-o 5 q)) (list 5))
(mk-tab-clear!)
(mk-test "tab-fib-ten" (run* q (tab-fib-o 10 q)) (list 55))
(mk-tab-clear!)
(mk-test
"tab-fib-twenty"
(run* q (tab-fib-o 20 q))
(list 6765))
;; --- ground-term predicate ---
(mk-test "tab-ground-term-num" (mk-tab-ground-term? 5) true)
(mk-test "tab-ground-term-str" (mk-tab-ground-term? "hi") true)
(mk-test
"tab-ground-term-list"
(mk-tab-ground-term? (list 1 2 3))
true)
(mk-test "tab-ground-term-var" (mk-tab-ground-term? (mk-var "x")) false)
(mk-test
"tab-ground-term-nested"
(mk-tab-ground-term?
(list 1 (list 2 (mk-var "y")) 3))
false)
;; --- caching reduces work — count cache hits via repeated query ---
(mk-test
"tab-cache-replay"
(begin
(mk-tab-clear!)
(let
((first (run* q (tab-fib-o 10 q)))
(second (run* q (tab-fib-o 10 q))))
(and (= first (list 55)) (= second (list 55)))))
true)
(mk-tests-run!)