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.
78 lines
1.7 KiB
Plaintext
78 lines
1.7 KiB
Plaintext
;; lib/minikanren/tests/laziness.sx — verify Zzz wrapping (in conde)
|
|
;; lets infinitely-recursive relations produce finite prefixes via run-n.
|
|
|
|
;; --- a relation that has no base case but conde-protects via Zzz ---
|
|
|
|
(define
|
|
listo-aux
|
|
(fn
|
|
(l)
|
|
(conde ((nullo l)) ((fresh (a d) (conso a d l) (listo-aux d))))))
|
|
|
|
(mk-test
|
|
"infinite-relation-truncates-via-run-n"
|
|
(run 4 q (listo-aux q))
|
|
(list
|
|
(list)
|
|
(list (make-symbol "_.0"))
|
|
(list (make-symbol "_.0") (make-symbol "_.1"))
|
|
(list (make-symbol "_.0") (make-symbol "_.1") (make-symbol "_.2"))))
|
|
|
|
;; --- two infinite generators interleaved via mk-disj must both produce
|
|
;; answers (no starvation) — the fairness test ---
|
|
|
|
(define
|
|
ones-gen
|
|
(fn
|
|
(l)
|
|
(conde
|
|
((== l (list)))
|
|
((fresh (d) (conso 1 d l) (ones-gen d))))))
|
|
|
|
(define
|
|
twos-gen
|
|
(fn
|
|
(l)
|
|
(conde
|
|
((== l (list)))
|
|
((fresh (d) (conso 2 d l) (twos-gen d))))))
|
|
|
|
(mk-test
|
|
"interleaving-keeps-both-streams-alive"
|
|
(let
|
|
((res (run 4 q (mk-disj (ones-gen q) (twos-gen q)))))
|
|
(and
|
|
(= (len res) 4)
|
|
(and
|
|
(some
|
|
(fn
|
|
(x)
|
|
(and
|
|
(list? x)
|
|
(and (not (empty? x)) (= (first x) 1))))
|
|
res)
|
|
(some
|
|
(fn
|
|
(x)
|
|
(and
|
|
(list? x)
|
|
(and (not (empty? x)) (= (first x) 2))))
|
|
res))))
|
|
true)
|
|
|
|
;; --- run* terminates on a relation whose conde has finite base case
|
|
;; reached from any starting point ---
|
|
|
|
(mk-test
|
|
"run-star-terminates-on-bounded-relation"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(l)
|
|
(== l (list 1 2 3))
|
|
(listo l)
|
|
(== q :ok)))
|
|
(list :ok))
|
|
|
|
(mk-tests-run!)
|