Prolog-Style Meta-Programming miniKanren
summary
A Prolog‑style meta interpreter for miniKanren generates proof-tree derivations that pinpoint why simply typed lambda calculus self‑application fails by showing the occurs‑check unification that aborts type inference, and a cycler meta interpreter records seen goals to collapse infinite path searches into a finite set of distinct paths. The system is pure user‑level: a define‑rel macro plus small interpreters reify goals and trace execution, requires no runtime changes to miniKanren, and the demos successfully produce actionable error traces and terminating run* results.
AI-written summary · about