Visualizing miniKanren Search with a Fine-Grained Small-Step Semantics
This program is tentative and subject to change.
We present a deterministic small-step operational semantics for miniKanren that explicitly represents the evolving search tree during execution. This semantics models interleaving and goal scheduling at fine granularity, allowing each evaluation step—goal activation, suspension, resumption, and success—to be visualized precisely. Building on this model, we implement an interactive visualizer that renders the search tree as it develops and lets users step through execution. The tool acts as a pedagogical notional machine for reasoning about miniKanren’s fair search behavior, helping users understand surprising answer orders and operational effects. Our semantics and tool are validated through property-based testing and illustrated with several examples.
This program is tentative and subject to change.
Fri 17 OctDisplayed time zone: Perth change
16:00 - 17:30 | Explorations in miniKanren and Relational Programming & Panel/DiscussionminiKanren at Peony NW Chair(s): Dmitri Boulytchev Saint Petersburg State University | ||
16:00 26mTalk | Computational Exploration of Finite Semigroupoids miniKanren | ||
16:26 26mTalk | Visualizing miniKanren Search with a Fine-Grained Small-Step Semantics miniKanren | ||
16:52 38mPanel | Frontiers: What's next for miniKanren and Relational Programming? miniKanren Jason Hemann Seton Hall University |