wile-goast: Skill for Claude Code

Semiring queries over the Go call graph

A path question over a call graph is an algebra question. Pick the semiring and the query writes itself. Do not hand-roll a traversal.

Routing: derive the semiring in three lines

1. What do you accumulate along a path? A yes/no, a cost, a count.
2. What is ⊕ (combine two alternative paths)? OR, min, +.
3. What is ⊗ (extend a path by one edge)? AND, +, ×.

Those two operators name the semiring: OR/AND → boolean · min/+ → tropical · +/× → counting. If your answer doesn't fit, it is probably not a semiring question — see Not a semiring question.

Setup, once

(import (wile goast callgraph)     ; go-callgraph
        (wile goast path-algebra)  ; make-path-analysis, path-query, ...
        (wile goast utils)         ; nf — field access on cg-node / cg-edge
        (wile algebra semiring))   ; boolean-semiring, tropical-semiring, ...

(define cg (go-callgraph "«pattern»" 'vta))

Build the graph once and pass it around; name the algorithm explicitly ('static < 'cha < 'rta < 'vta in precision and cost; 'rta errors without a main). Rebuilding per query is the dominant cost in a slow session.

Call-graph records are accessed with nf, not per-field accessors: (nf edge 'callee), (nf edge 'caller), (nf edge 'pos), (nf node 'name). There is no cg-edge-callee.

---

R1 · Reachability — boolean

Intent triggers: can X reach Y · what does X reach · what reaches Y · does this handler ever hit the DB · blast radius of changing Y

Reduction principle: accumulate reachable-or-not. ⊕ = OR (any one path suffices), ⊗ = AND (a path exists only if every edge on it does). → boolean.

Structure: (boolean-semiring), unit weights (#f).

Recipe:

(go-callgraph-reachable cg "«root»")    ; forward: everything root can reach
(go-callgraph-reaching  cg "«target»")  ; backward: transitive callers = blast radius

(path-query (make-path-analysis (boolean-semiring) cg #f)
            "«src»" "«dst»")            ; point-to-point => #t / #f