Files
rose-ash/lib/minikanren/tests/tabling-more.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

56 lines
1.1 KiB
Plaintext

;; lib/minikanren/tests/tabling-more.sx — table-1 + table-3.
;; --- table-1 (predicate caching) ---
(define
tab-in-list
(table-1
"in-list"
(fn
(x)
(membero
x
(list 1 2 3 4 5)))))
(mk-tab-clear!)
(mk-test
"table-1-hit"
(run* q (tab-in-list 3))
(list (make-symbol "_.0")))
(mk-test "table-1-miss-no" (run* q (tab-in-list 99)) (list))
(mk-test
"table-1-replay"
(run* q (tab-in-list 3))
(list (make-symbol "_.0")))
;; --- table-3 (Ackermann) ---
(define
ack-o
(table-3
"ack"
(fn
(m n result)
(conde
((== m 0) (pluso-i n 1 result))
((fresh (m-1) (lto-i 0 m) (== n 0) (minuso-i m 1 m-1) (ack-o m-1 1 result)))
((fresh (m-1 n-1 inner) (lto-i 0 m) (lto-i 0 n) (minuso-i m 1 m-1) (minuso-i n 1 n-1) (ack-o m n-1 inner) (ack-o m-1 inner result)))))))
(mk-tab-clear!)
(mk-test
"ack-0-0"
(run* q (ack-o 0 0 q))
(list 1))
(mk-tab-clear!)
(mk-test
"ack-2-3"
(run* q (ack-o 2 3 q))
(list 9))
(mk-tab-clear!)
(mk-test
"ack-3-3"
(run* q (ack-o 3 3 q))
(list 61))
(mk-tests-run!)