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.
26 lines
1.0 KiB
Plaintext
26 lines
1.0 KiB
Plaintext
;; lib/minikanren/fd.sx — Phase 6 piece A: minimal finite-domain helpers.
|
|
;;
|
|
;; A full CLP(FD) engine (arc consistency, native integer domains, fd-plus
|
|
;; etc.) is Phase 6 proper. For now we expose two small relations layered
|
|
;; on the existing list machinery — they're sufficient for permutation
|
|
;; puzzles, the N-queens-style core of constraint solving:
|
|
;;
|
|
;; (ino x dom) — x is a member of dom (alias for membero with the
|
|
;; constraint-store-friendly argument order).
|
|
;; (all-distincto l) — all elements of l are pairwise distinct.
|
|
;;
|
|
;; all-distincto uses nafc + membero on the tail — it requires the head
|
|
;; element of each recursive step to be ground enough for membero to be
|
|
;; finitary, so order matters: prefer (in x dom) goals BEFORE
|
|
;; (all-distincto (list x ...)) so values get committed first.
|
|
|
|
(define ino (fn (x dom) (membero x dom)))
|
|
|
|
(define
|
|
all-distincto
|
|
(fn
|
|
(l)
|
|
(conde
|
|
((nullo l))
|
|
((fresh (a d) (conso a d l) (nafc (membero a d)) (all-distincto d))))))
|