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.
129 lines
2.1 KiB
Plaintext
129 lines
2.1 KiB
Plaintext
;; lib/minikanren/tests/clpfd-ord.sx — fd-lt / fd-lte / fd-eq.
|
|
|
|
;; --- fd-lt ---
|
|
|
|
(mk-test
|
|
"fd-lt-narrows-x-against-num"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3 4 5))
|
|
(fd-lt x 3)
|
|
(fd-label (list x))
|
|
(== q x)))
|
|
(list 1 2))
|
|
|
|
(mk-test
|
|
"fd-lt-narrows-x-against-num-symmetric"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3 4 5))
|
|
(fd-lt 3 x)
|
|
(fd-label (list x))
|
|
(== q x)))
|
|
(list 4 5))
|
|
|
|
(mk-test
|
|
"fd-lt-pair-ordered"
|
|
(let
|
|
((res (run* q (fresh (x y) (fd-in x (list 1 2 3 4)) (fd-in y (list 1 2 3 4)) (fd-lt x y) (fd-label (list x y)) (== q (list x y))))))
|
|
(= (len res) 6))
|
|
true)
|
|
|
|
(mk-test
|
|
"fd-lt-impossible-fails"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 5 6 7))
|
|
(fd-lt x 3)
|
|
(fd-label (list x))
|
|
(== q x)))
|
|
(list))
|
|
|
|
;; --- fd-lte ---
|
|
|
|
(mk-test
|
|
"fd-lte-includes-equal"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3 4 5))
|
|
(fd-lte x 3)
|
|
(fd-label (list x))
|
|
(== q x)))
|
|
(list 1 2 3))
|
|
|
|
(mk-test
|
|
"fd-lte-equal-bound"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3 4 5))
|
|
(fd-lte 3 x)
|
|
(fd-label (list x))
|
|
(== q x)))
|
|
(list 3 4 5))
|
|
|
|
;; --- fd-eq ---
|
|
|
|
(mk-test
|
|
"fd-eq-bind"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3 4 5))
|
|
(fd-eq x 3)
|
|
(== q x)))
|
|
(list 3))
|
|
|
|
(mk-test
|
|
"fd-eq-out-of-domain-fails"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x)
|
|
(fd-in x (list 1 2 3))
|
|
(fd-eq x 5)
|
|
(== q x)))
|
|
(list))
|
|
|
|
(mk-test
|
|
"fd-eq-two-vars-share-domain"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x y)
|
|
(fd-in x (list 1 2 3))
|
|
(fd-in y (list 2 3 4))
|
|
(fd-eq x y)
|
|
(fd-label (list x y))
|
|
(== q (list x y))))
|
|
(list (list 2 2) (list 3 3)))
|
|
|
|
;; --- combine fd-lt + fd-neq for "between" puzzle ---
|
|
|
|
(mk-test
|
|
"fd-lt-neq-combined"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(x y z)
|
|
(fd-in x (list 1 2 3))
|
|
(fd-in y (list 1 2 3))
|
|
(fd-in z (list 1 2 3))
|
|
(fd-lt x y)
|
|
(fd-lt y z)
|
|
(fd-label (list x y z))
|
|
(== q (list x y z))))
|
|
(list (list 1 2 3)))
|
|
|
|
(mk-tests-run!)
|