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.
88 lines
2.4 KiB
Plaintext
88 lines
2.4 KiB
Plaintext
;; lib/minikanren/tests/classics.sx — small classic-style puzzles that
|
|
;; exercise the full system end to end (relations + conde + matche +
|
|
;; fresh + run*). Each test is a self-contained miniKanren program.
|
|
|
|
;; -----------------------------------------------------------------------
|
|
;; Pet puzzle (3 friends, 3 pets, 1-each).
|
|
;; -----------------------------------------------------------------------
|
|
|
|
(mk-test
|
|
"classics-pet-puzzle"
|
|
(run*
|
|
q
|
|
(fresh
|
|
(a b c)
|
|
(== q (list a b c))
|
|
(permuteo (list :dog :cat :fish) (list a b c))
|
|
(== b :fish)
|
|
(conde ((== a :cat)) ((== a :fish)))))
|
|
(list (list :cat :fish :dog)))
|
|
|
|
;; -----------------------------------------------------------------------
|
|
;; Family-relations puzzle (uses membero on a fact list).
|
|
;; -----------------------------------------------------------------------
|
|
|
|
(define
|
|
parent-facts
|
|
(list
|
|
(list "alice" "bob")
|
|
(list "alice" "carol")
|
|
(list "bob" "dave")
|
|
(list "carol" "eve")
|
|
(list "dave" "frank")))
|
|
|
|
(define parento (fn (x y) (membero (list x y) parent-facts)))
|
|
|
|
(define grandparento (fn (x z) (fresh (y) (parento x y) (parento y z))))
|
|
|
|
(mk-test
|
|
"classics-grandparents-of-frank"
|
|
(run* q (grandparento q "frank"))
|
|
(list "bob"))
|
|
|
|
(mk-test
|
|
"classics-grandchildren-of-alice"
|
|
(run* q (grandparento "alice" q))
|
|
(list "dave" "eve"))
|
|
|
|
;; -----------------------------------------------------------------------
|
|
;; Symbolic differentiation, matche-driven.
|
|
;; Variable :x: d/dx x = 1
|
|
;; Sum (:+ a b): d/dx (a+b) = (da + db)
|
|
;; Product (:* a b): d/dx (a*b) = (da*b + a*db)
|
|
;; -----------------------------------------------------------------------
|
|
|
|
(define
|
|
diffo
|
|
(fn
|
|
(expr var d)
|
|
(matche
|
|
expr
|
|
(:x (== d 1))
|
|
((:+ a b)
|
|
(fresh
|
|
(da db)
|
|
(== d (list :+ da db))
|
|
(diffo a var da)
|
|
(diffo b var db)))
|
|
((:* a b)
|
|
(fresh
|
|
(da db)
|
|
(== d (list :+ (list :* da b) (list :* a db)))
|
|
(diffo a var da)
|
|
(diffo b var db))))))
|
|
|
|
(mk-test "classics-diff-of-x" (run* q (diffo :x :x q)) (list 1))
|
|
|
|
(mk-test
|
|
"classics-diff-of-x-plus-x"
|
|
(run* q (diffo (list :+ :x :x) :x q))
|
|
(list (list :+ 1 1)))
|
|
|
|
(mk-test
|
|
"classics-diff-of-x-times-x"
|
|
(run* q (diffo (list :* :x :x) :x q))
|
|
(list (list :+ (list :* 1 :x) (list :* :x 1))))
|
|
|
|
(mk-tests-run!)
|