Tree
The tree of a program under finite response sets. A program is a value: a tree whose nodes are the effects it performs and whose edges are the responses it may receive, with a return value at every leaf. Nothing in the value says what an effect does; the handlers applied to it decide that when it runs, and one run under one stack is a Trace. The tree is the program itself, unfolded: an effect whose response type is finite (Boolean, an enum, a sealed hierarchy of objects, Unit) under every response, an effect whose response type is infinite under the Representatives the caller names, and an effect that can have no response at all, such as a failure, as a leaf. tree builds it.
Inheritors
Functions
The responses that opened no path of their own: at an effect, a response whose subtree has the shape of an earlier response's, the shape of a subtree being its effects by class and its leaves by outcome, with responses and effect arguments ignored. Such a response adds no effect and no outcome a reader could not reach through its sibling. The representatives of an infinite response type are well chosen when none of them is listed here.