Run Graph API

Run Graph API

The second design round for Run, after your message of 19:15 (the API may change freely) and your notes on the page “Run 0.07 Jobs”, which this page replaces. Nothing below is written yet, except R5. The base is Run 0.06 (claude/Run-0.06.tar.gz-base64.txt).

Words used throughout. The graph: processes, and the ends they are connected to (E1). An edge: a process plus one end, under an fd number (R8). Forgetting an end: Run closes its own copy of it (R6). An action: a sub reference run when a process ends (R9). The loop: the code in Run that reaps children and runs actions (L1). A job: K1. The executor: the code, not written yet, that runs ShellSubset parse trees (spec section 8) on top of Run; the S items describe it. Forkless: $Run::Forkless (R5).

Each item ends with “Depends on”. If an item it depends on is No-go, the item is dropped too, unless its text says otherwise.

✓ Go: do it as planned. ✗ No-go: don’t; do what “If No-go” says. ◆ Discuss strategy first: settle the approach first; holds back only the items that depend on it. ? Explain first: a show-stopper; I explain before doing anything else. ? Explain later: I explain after doing the rest. Unmarked: not done this round, left for later; it is not a rejection. A note that settles an item (picks an option, states the rule, or says the plan is right) counts as Go even without the button. My answers carry a tag: No reply needed, Your turn (I asked you something), or Answered, Claude hasn’t read it yet. The “Your turn” filter shows the items waiting for you.
What Go means

Loading marks…

Filters