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.
40 lines
1.4 KiB
Plaintext
40 lines
1.4 KiB
Plaintext
;; lib/minikanren/conde.sx — Phase 2 piece C: `conde`, the canonical
|
|
;; miniKanren and-or form, with implicit Zzz inverse-eta delay so recursive
|
|
;; relations like appendo terminate.
|
|
;;
|
|
;; (conde (g1a g1b ...) (g2a g2b ...) ...)
|
|
;; ≡ (mk-disj (Zzz (mk-conj g1a g1b ...))
|
|
;; (Zzz (mk-conj g2a g2b ...)) ...)
|
|
;;
|
|
;; `Zzz g` wraps a goal expression in (fn (S) (fn () (g S))) so that
|
|
;; `g`'s body isn't constructed until the surrounding fn is applied to a
|
|
;; substitution AND the returned thunk is forced. This is what gives
|
|
;; miniKanren its laziness — recursive goal definitions can be `(conde
|
|
;; ... (... (recur ...)))` without infinite descent at construction time.
|
|
;;
|
|
;; Hygiene: the substitution parameter is gensym'd so that user goal
|
|
;; expressions which themselves bind `s` (e.g. `(appendo l s ls)`) keep
|
|
;; their lexical `s` and don't accidentally reference the wrapper's
|
|
;; substitution. Without gensym, miniKanren relations that follow the
|
|
;; common (l s ls) parameter convention are silently miscompiled.
|
|
|
|
(defmacro
|
|
Zzz
|
|
(g)
|
|
(let
|
|
((s-sym (gensym "zzz-s-")))
|
|
(quasiquote
|
|
(fn ((unquote s-sym)) (fn () ((unquote g) (unquote s-sym)))))))
|
|
|
|
(defmacro
|
|
conde
|
|
(&rest clauses)
|
|
(quasiquote
|
|
(mk-disj
|
|
(splice-unquote
|
|
(map
|
|
(fn
|
|
(clause)
|
|
(quasiquote (Zzz (mk-conj (splice-unquote clause)))))
|
|
clauses)))))
|