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.
59 lines
1.5 KiB
Plaintext
59 lines
1.5 KiB
Plaintext
;; lib/minikanren/goals.sx — Phase 2 piece B: core goals.
|
|
;;
|
|
;; A goal is a function (fn (s) → stream-of-substitutions).
|
|
;; Goals built here:
|
|
;; succeed — always returns (unit s)
|
|
;; fail — always returns mzero
|
|
;; == — unifies two terms; succeeds with a singleton, else fails
|
|
;; ==-check — opt-in occurs-checked equality
|
|
;; conj2 / mk-conj — sequential conjunction of goals
|
|
;; disj2 / mk-disj — interleaved disjunction of goals (raw — `conde` adds
|
|
;; the implicit-conj-per-clause sugar in a later commit)
|
|
|
|
(define succeed (fn (s) (unit s)))
|
|
|
|
(define fail (fn (s) mzero))
|
|
|
|
(define
|
|
==
|
|
(fn
|
|
(u v)
|
|
(fn
|
|
(s)
|
|
(let ((s2 (mk-unify u v s))) (if (= s2 nil) mzero (unit s2))))))
|
|
|
|
(define
|
|
==-check
|
|
(fn
|
|
(u v)
|
|
(fn
|
|
(s)
|
|
(let ((s2 (mk-unify-check u v s))) (if (= s2 nil) mzero (unit s2))))))
|
|
|
|
(define conj2 (fn (g1 g2) (fn (s) (mk-bind (g1 s) g2))))
|
|
|
|
(define disj2 (fn (g1 g2) (fn (s) (mk-mplus (g1 s) (g2 s)))))
|
|
|
|
;; Fold goals in a list. (mk-conj-list ()) ≡ succeed; (mk-disj-list ()) ≡ fail.
|
|
(define
|
|
mk-conj-list
|
|
(fn
|
|
(gs)
|
|
(cond
|
|
((empty? gs) succeed)
|
|
((empty? (rest gs)) (first gs))
|
|
(:else (conj2 (first gs) (mk-conj-list (rest gs)))))))
|
|
|
|
(define
|
|
mk-disj-list
|
|
(fn
|
|
(gs)
|
|
(cond
|
|
((empty? gs) fail)
|
|
((empty? (rest gs)) (first gs))
|
|
(:else (disj2 (first gs) (mk-disj-list (rest gs)))))))
|
|
|
|
(define mk-conj (fn (&rest gs) (mk-conj-list gs)))
|
|
|
|
(define mk-disj (fn (&rest gs) (mk-disj-list gs)))
|